Optimizing a bi鈥恛bjective vehicle routing problem that appears in industrial enterprises.
In this paper, a new solution method is implemented to solve a bi鈥恛bjective variant of the vehicle routing problem that appears in industry and environmental enterprises. The solution involves designing a set of routes for each day in a period, in which the service frequency is a decision variable. The proposed algorithm, a muti鈥恠tart multi鈥恛bjective local search algorithm (MSMLS), minimizes total emissions produced by all vehicles and maximizes the service quality measured as the number of times that a customer is visited by a vehicle in order to be served. The MSMLS is a neighbourhood鈥恇ased metaheuristic that obtains high鈥恞uality solutions and that is capable of achieving better performance than other competitive algorithms. Furthermore, the proposed algorithm is able to perform rapid movements thanks to the easy representation of the solutions.
L贸pez鈥怱谩nchez, Ana D.; Molina, Juli谩n; Laguna, Manuel; Hern谩ndez鈥怐铆az, Alfredo G. Expert Systems. Jan2021, Vol. 38 Issue 1, p1-18.听听听
https://onlinelibrary.wiley.com/doi/full/10.1111/exsy.12638