Multi-level Evolutionary Genetic Algorithm for Solving VRPSPD Problem

In the field of industrial production and distribution, in order to meet the production needs of production enterprises, it is necessary to consider the customer’s need for simultaneous picking and delivery in the classic vehicle routing optimization problem, which we called VRPSPD(vehicle routing problem with simultaneous pick-up and delivery). In order to minimize the transportation cost and rationally use the distribution vehicle to balance the workload, establishing a VRPSPD target model that considers both the transportation cost and minimizing the maximum transport length difference between distribution lines, and constructing an improved genetic algorithm(GA) based on the characteristics of the model. The algorithm use the RMPCIM insertion method to improve the global search ability and accelerate the iterative process. At the same time, a new multi-level evolution iterative process is adopted in the population iteration to improve the superiority of the algorithm. The accuracy of the algorithm is verifified by the simulation of 18 sets of Solomon exextended instances. Compared with different algorithms in the literature,the result shows that the algorithm can weigh the objective function and obtain the optimal objective function.

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

[2]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[3]  Gur Mosheiov,et al.  The traveling salesman problem with delivery and backhauls , 1994, Oper. Res. Lett..

[4]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

[5]  Emmanouil E. Zachariadis,et al.  A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries , 2011, Expert Syst. Appl..

[6]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7]  AvciMustafa,et al.  A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery , 2016 .

[8]  Behnam Vahdani,et al.  Development and optimization of a horizontal carrier collaboration vehicle routing model with multi-commodity request allocation , 2019, Journal of Cleaner Production.

[9]  Gábor Nagy,et al.  A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries , 2008, J. Comb. Optim..

[10]  Antonio López Jaimes,et al.  An investigation into many-objective optimization on combinatorial problems: Analyzing the pickup and delivery problem , 2018, Swarm Evol. Comput..

[11]  Khaled Abdelghany,et al.  The hybrid vehicle-drone routing problem for pick-up and delivery services , 2019, Transportation Research Part C: Emerging Technologies.

[12]  Wout Dullaert,et al.  A multi-parametric evolution strategies algorithm for vehicle routing problems , 2007, Expert Syst. Appl..

[13]  Hsiao-Fan Wang,et al.  A genetic algorithm for the simultaneous delivery and pickup problems with time window , 2012, Comput. Ind. Eng..

[14]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[15]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[16]  Seyda Topaloglu,et al.  A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery , 2016, Expert Syst. Appl..