A New Approach to the Optimization of the CVRP through Genetic Algorithms

This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.

[1]  Marcus Poggi de Aragão,et al.  Improved lower bounds for the Split Delivery Vehicle Routing Problem , 2010, Oper. Res. Lett..

[2]  Gilbert Laporte,et al.  A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars , 2010, Eur. J. Oper. Res..

[3]  Anna Sciomachen,et al.  A food distribution network problem: a case study , 2007 .

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Chelsea C. White,et al.  An empirical study on the benefit of split loads with the pickup and delivery problem , 2009, Eur. J. Oper. Res..

[6]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[7]  Maged M. Dessouky,et al.  A two‐stage vehicle routing model for large‐scale bioterrorism emergencies , 2009, Networks.

[8]  José-Manuel Belenguer,et al.  Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic , 2010, Transp. Sci..

[9]  Mingzhou Jin,et al.  A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem , 2007 .

[10]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[11]  Sumanta Basu Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey , 2012 .

[12]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[13]  Enrique Alba,et al.  A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem , 2008, Engineering Evolutionary Intelligent Systems.

[14]  Xinhui Zhang,et al.  An adaptive memory algorithm for the split delivery vehicle routing problem , 2010, J. Heuristics.

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

[16]  Rafael E. Aleman,et al.  A tabu search with vocabulary building approach for the vehicle routing problem with split demands , 2010, Int. J. Metaheuristics.

[17]  Yavuz A. Bozer,et al.  A shortest path approach to the multiple-vehicle routing problem with split pick-ups , 2006 .

[18]  Hugo Tsugunobu Yoshida Yoshizaki,et al.  Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil , 2009, Eur. J. Oper. Res..

[19]  Ulrich Derigs,et al.  Local search-based metaheuristics for the split delivery vehicle routing problem , 2010, J. Oper. Res. Soc..

[20]  Ángel Corberán,et al.  A New Metaheuristic for the Vehicle Routing Problem with Split Demands , 2007, EvoCOP.

[21]  Sam R. Thangiah,et al.  Real-time split-delivery pickup and delivery time window problems with transfers , 2007, Central Eur. J. Oper. Res..

[22]  Reza Tavakkoli-Moghaddam,et al.  A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing , 2007, J. Frankl. Inst..

[23]  Alex Van Breedam,et al.  An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-relatezd, customer-related, and time-related constraints , 1994 .

[24]  Hiroshi Nagamochi,et al.  A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem , 2007 .

[25]  T. M. Cavalier,et al.  A Construction Heuristic for the Split Delivery Vehicle Routing Problem , 2012 .

[26]  Ramasamy Panneerselvam,et al.  A Survey on the Vehicle Routing Problem and Its Variants , 2012 .

[27]  Feng Chu,et al.  A new model and hybrid approach for large scale inventory routing problems , 2008, Eur. J. Oper. Res..