Evolutionary Multi-objective Optimization for Multi-depot Vehicle Routing in Logistics

Delivering goods in an efficient and cost-effective way is always a challenging problem in logistics. In this paper, the multi-depot vehicle routing is focused. To cope with the conflicting requirements, an advanced multi-objective evolutionary algorithm is proposed. Local-search empowered genetic operations and a fuzzy cluster-based initialization process are embedded in the design for performance enhancement. Its outperformance, as compared to existing alternatives, is confirmed by extensive simulations based on numerical datasets and real traffic conditions with various customers’ distributions.

[1]  Denis Borenstein,et al.  Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem , 2016, Optim. Lett..

[2]  Ilkyeong Moon,et al.  Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles , 2016 .

[3]  Anand Subramanian,et al.  A hybrid algorithm for a class of vehicle routing problems , 2013, Comput. Oper. Res..

[4]  Demetrio Laganà,et al.  The Undirected Capacitated General Routing Problem with Profits , 2017, Eur. J. Oper. Res..

[5]  Zakir Hussain Ahmed.  A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem , 2013, TECS.

[6]  Pierre Borne,et al.  Genetic Algorithm for Multi-Criteria Optimization of Multi-Depots Pick-up and Delivery Problems with Time Windows and Multi-Vehicles , 2015 .

[7]  Ling Wei,et al.  Fitness-scaling adaptive genetic algorithm with local search for solving the Multiple Depot Vehicle Routing Problem , 2016, Simul..

[8]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[9]  Jacques Renaud,et al.  A practical vehicle routing problem with desynchronized arrivals to depot , 2016, Eur. J. Oper. Res..

[10]  Laura Calvet,et al.  Combining statistical learning with metaheuristics for the Multi-Depot Vehicle Routing Problem with market segmentation , 2016, Comput. Ind. Eng..

[11]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[12]  K. Man,et al.  A genetic-based optimization for multi-depot vehicle routing problems , 2010, 2010 IEEE International Symposium on Industrial Electronics.

[13]  Abdollah Hadi-Vencheh,et al.  An unsupervised fuzzy clustering approach to the capacitated vehicle routing problem , 2015, Neural Computing and Applications.

[14]  Michel Gendreau,et al.  Implicit depot assignments and rotations in vehicle routing heuristics , 2014, Eur. J. Oper. Res..

[15]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[16]  Paolo Toth,et al.  A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem , 2014, J. Heuristics.

[17]  Henry C. W. Lau,et al.  A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..

[18]  Kim-Fung Man,et al.  A Jumping Gene Paradigm for Evolutionary Multiobjective Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[19]  Amaya Martínez-Puras,et al.  MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problem , 2016, Knowl. Based Syst..