Multiobjective Evolutionary Algorithm based on Fast Elite Sampling Strategy and Difference-based Local Search for VRPTW

This paper addresses the vehicle routing problem with time windows (VRPTW), aiming to reduce the vehicles number and to minimize the time-wasting during the delivery process caused by early arrival. For solving VRPTW, a multiobjective evolutionary algorithm based on fast elite sampling strategy and difference-based local search (MOEAFESS/DLS) is proposed. The special strategy in MOEAFESS/DLS is fast elite sampling strategy (FESS) which consists of two parts. First, using Pareto dominating and dominated relationship-based fitness function (PDDR-FF) to evaluate individuals, which can easily select nondominated individuals and the individuals which have larger domination area. Then, mixing with the sampling strategy of vector evaluated genetic algorithm (VEGA) can achieve fast convergence and sufficient diversity. The evolution according to FESS will be used as a global search strategy for MOEA-FESS/DLS. In addition, a local search based on differences between individuals called difference-based local search (DLS) is used in MOEA-FESS/DLS. In this way, the individuals with poor performance in the population generated by global search are guided to move closer to those who perform better. So it can further enhance the search ability of MOEA-FESS/DLS. Experimental results on Solomon benchmark demonstrate that the proposed MOEA-FESS/DLS is effective, which the performance outperforms NSGA-II, SPEA2 and MOEA/D.

[1]  Mitsuo Gen,et al.  Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem , 2014, J. Intell. Manuf..

[2]  Abel García-Nájera,et al.  An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows , 2011, Comput. Oper. Res..

[3]  Tolunay Göçken,et al.  Improvement of a genetic algorithm approach for the solution of vehicle routing problem with time windows , 2017, 2017 International Artificial Intelligence and Data Processing Symposium (IDAP).

[4]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[5]  Anupam Shukla,et al.  Vehicle Routing Problem with Time Windows Using Meta-Heuristic Algorithms: A Survey , 2018, Harmony Search and Nature Inspired Optimization Algorithms.

[6]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[7]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[8]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

[9]  Khaled Hassine,et al.  Genetic Algorithm for Solving a Dynamic Vehicle Routing Problem with Time Windows , 2018, 2018 International Conference on High Performance Computing & Simulation (HPCS).

[10]  Philip Kilby,et al.  Vehicle Routing Problem with Time Windows , 2004 .

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

[12]  Jun Wang,et al.  Hybrid Differential Evolution Optimization for the Vehicle Routing Problem with Time Windows and Driver-Specific Times , 2017, Wirel. Pers. Commun..

[13]  R. Tavakkoli-Moghaddam,et al.  Robust Periodic Vehicle Routing Problem with Time Windows under Uncertainty: An Efficient Algorithm , 2018 .

[14]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .