Edge assembly-based memetic algorithm for the capacitated vehicle routing problem

Networks

Volumn 54, Issue 4, 2009, Pages 205-215

  Nagata, Yuichi ^a   Bräysy, Olli ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Evolutionary algorithm; Memetic algorithm; Metaheuristics; Vehicle routing

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTING TIME; CONSTRAINT VIOLATION; EXPERIMENTAL TEST; IN-VEHICLE; LOCAL SEARCH; MEMETIC ALGORITHMS; META HEURISTICS; REAL-LIFE DISTRIBUTION PROBLEMS; TOTAL COSTS; VEHICLE ROUTING PROBLEMS;

ARTIFICIAL INTELLIGENCE; COMPETITION; DECISION SUPPORT SYSTEMS; DECISION THEORY; EVOLUTIONARY ALGORITHMS; FLEET OPERATIONS; VEHICLES;

ROUTING ALGORITHMS;

EID: 71949088204     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20333     Document Type: Article

References (39)

1. E. Alba and B. Dorronsoro, Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm, Inf Process Lett 98 (2006), 225-230.
2. J. Bramel and J. Simchi-Levi, "Set-covering-based algorithms for the capacitated VRP," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM, Philadelphia, 2001, pp. 85-108.
3. N. Christofides, A. Mingozzi, and P. Toth, "The vehicle routing problem," Combinatorial optimization, N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (Editors), Wiley, Chichester, 1979, pp. 315-338.
4. J.-F. Cordeau, M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet, A guide to vehicle routing heuristics, J Oper Res Soc 53 (2002), 512-522.
5. J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J.S. Sormany, "New heuristics for the vehicle routing problem," Logistics systems: Design and optimization, A. Langevin and D. Riopel (Editors), Springer, New York, 2005, pp. 279-297.
6. J.-F. Cordeau and G. Laporte, "Modeling and optimization of vehicle routing and arc routing problems," Handbook on modelling for discrete optimization, G. Appa, L. Pitsoulis, and H.P. Williams (Editors), Springer, New York, 2006, pp. 151-191.
7. J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, and D. Vigo, "Vehicle routing," Transportation, handbooks in operations research and management science, Vol.14, C. Barnhart and G. Laporte (Editors), Elsevier, Amsterdam, 2007, pp. 367-428.
8. G.B. Dantzig and J.H. Ramser, The truck dispatching problem, Manage Sci 6 (1959), 80-91.
9. A. El Fallahi, C. Prins, and R. Wolfler-Calvo, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Comput Oper Res 35 (2008), 1725-1741.
10. M.M. Flood, The traveling-salesman problem, Oper Res 4 (1956), 61-75.
11. M. Gendreau, A. Hertz, and G. Laporte, A tabu search heuristic for the vehicle routing problem, Manage Sci 40 (1994), 1276-1290.
12. M. Gendreau, G. Laporte, and J.-Y. Potvin, "Metaheuristics for the capacitated VRP," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM, Philadelphia, 2001, pp. 129-154.
13. B.L. Golden, E.A. Wasil, J.P. Kelly, and I.M. Chao, "Meta-heuristics in vehicle routing," Fleet management and logistics, T.G Crainic and G. Laporte (Editors), Kluwer, Boston, 1998, pp. 33-56.
14. B. Golden, S. Raghavan, and E. Wasil (Editors), The vehicle routing problem, latest advances and new challenges, Operations Research/Computer Science Interfaces Series 43, Springer, New York, 2008.
15. G.A.P. Kindervater and M.W.P. Savelsbergh, "Vehicle routing, handling edge exchanges," Local search in combinatorial optimization, E.H.L. Aarts and J.K. Lenstra (Editors), Wiley, Chichester, 1997, pp. 337-360.
16. P. Lacomme, C. Prins, and W. Ramdane-Chérif, Evolutionary algorithms for periodic arc routing problems, Eur J Oper Res 165 (2005), 535-553. (Pubitemid 40206381)
17. G. Laporte, M. Gendreau, J.-Y. Potvin, and F. Semet, Classical and modern heuristics for the vehicle routing problem, Int Trans Oper Res 7 (2000), 285-300.
18. G. Laporte and F. Semet, "Classical heuristics for the capacitated VRP," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM, Philadelphia, 2001, pp. 109-128.
19. C.M.R.R. Lima, M.C. Goldbarg, and E.F.G. Goldbarg, A memetic algorithm for the heterogeneous fleet vehicle routing problem, Electron Notes Discrete Math 18 (2004), 171-176.
20. D. Mester and O. Bräysy, Active guided evolution strategies for large scale vehicle routing problems with time windows, Comput Oper Res 32 (2005), 1593-1614.
21. D. Mester, O. Bräysy, and W. Dullaert, A multi-parametric evolution strategies algorithm for vehicle routing problems, Expert Syst Appl 32 (2007), 508-517. (Pubitemid 44647817)
22. D. Mester and O. Bräysy, Active guided evolution strategies for large scale capacitated vehicle routing problems, Comput Oper Res 34 (2007), 2964-2975.
23. P. Moscato, On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms, C3P Report 826, California Institute of Technology, California, 1989.
24. D. Naddef and G. Rinaldi, "Branch-and-cut algorithms for the capacitated VRP," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM, Philadelphia, 2001, pp. 53-84.
25. Y. Nagata, Fast EAX algorithm considering population diversity for traveling salesman problems, Proceedings of the 6th International Conference on EvoCOP2006, 2006, pp. 171-182.
26. Y. Nagata, New EAX crossover for large TSP instances, Proceedings of the 9th International Conference on Parallel Problem Solving from Nature, 2006, pp. 372-381.
27. Y. Nagata and O. Bräysy, A powerful route minimization heuristic for the vehicle routing problem with time windows, Oper Res Lett 37 (2009), 333-338.
28. Y. Nagata and S. Kobayashi, Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem, Proceedings of the 7th International Conference on Genetic Algorithms, 1997, pp. 450-457.
29. D. Pisinger and S. Røpke, A general heuristic for vehicle routing problems, Comput Oper Res 34 (2007), 2403-2435.
30. J.-Y. Potvin and J.-M. Rousseau, An exchange heuristic for routeing problems with time windows, J Oper Res Soc 46 (1995), 1433-1446.
31. C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Comput Oper Res 31 (2004), 1985-2002.
32. M. Reimann, K. Doerner, and R. Hartl, D-ants: Savings based ants divide and conquer the vehicle routing problem, Comput Oper Res 31 (2004), 563-591.
33. Y. Rochat and E. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, J Heuristics 1 (1995), 147-167.
34. E. Taillard, Parallel iterative search methods for vehicle routing problems, Networks 23 (1993), 661-673.
35. E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows, Transport Sci 31 (1997), 170-186. (Pubitemid 127597092)
36. C.D. Tarantilis, Solving the vehicle routing problem with adaptive memory programming methodology, Comput Oper Res 32 (2005), 2309-2327.
37. R. Tavakkoli-Moghaddam, A.R. Saremi, and M.S. Ziaee, A memetic algorithm for a vehicle routing problem with backhauls, Appl Math Comput 181 (2006), 1049-1060.
38. P. Toth and D. Vigo, "Branch-and-bound algorithms for the capacitated VRP," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM, Philadelphia, 2001, pp. 29-52.
39. P. Toth and D. Vigo, The granular tabu search (and its application to the vehicle routing problem), INFORMS J Comput 15 (2003), 333-348.