Edge assembly crossover for the capacitated vehicle routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4446 LNCS, Issue , 2007, Pages 142-153

  Nagata, Yuichi ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; EVOLUTIONARY ALGORITHMS; TRAVELING SALESMAN PROBLEM;

CAPACITATED VEHICLE ROUTING PROBLEM (CVRP); CONSTRAINT VIOLATION; EDGE ASSEMBLY CROSSOVER (EAX); PENALTY FUNCTION; VEHICLE CAPACITY;

VEHICLE ROUTING;

EID: 36549074177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71615-0_13     Document Type: Conference Paper

References (15)

1. B.L. Golden, E.A. Wasil, J.P. Kelly, I.M. Chao. Metaheuristics in vehicle routing. In T.G Crainic and C. Laporte, editors, Fleet Management and Logistics, Kiuwer, Boston, MA, pp. 33-56, 1998.
2. P. Toth and D. Vigo. The granular tabu search and its application to the Vehicle Routing problem, INFORMS Journal on Computating 15, pp. 333-346.
3. E. D. Taillard. Parallel Iterative Search Methods for Vehicle Routing Problems, Networks 23, 661-673, 1993.
4. J. Kelly, J. P. Xu. A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem, Transportation Science 30, 379-393, 1996.
5. D. Mester and O. Braysy. Active Guided Evolution Strategies for Large Scale Vehicle Routing Problems with Time Windows, Computers & Operations Research 32, pp. 1593-1614, 2005.
6. Prins, C. A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research 31, pp. 1985-2002, 2004.
7. E. Alba, B. Dorronsoro. Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms, Evolutionary Computation in Combinatorial Optimization - EvoCOP 2004, LNCS, Vol. 3004, pp. 11-20, 2004.
8. J. F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, J.S. Sormany. New Heuristics for the Vehicle Routing Problem, Logistics Systems: Design and Optimization, A. Langevin and D. Riopel, editors, Springer, New York, pp. 279-297, 2005.
9. http://www.tsp.gatech.edu/sweden/index.html
10. Y. Nagata, S. Kobayashi. Edge Assembly Crossover: A High-power Genetic Algorithm for the Traveling Salesman Problem, Proc. of the 7th Int. Conference on Genetic Algorithms, pp. 450-457, 1997.
11. Y. Nagata, Fast EAX algorithm Considering Population Diversity for Traveling Salesman Problems, Proc. of the 6th Int. Conf. on EvoCOP2006, pp. 171-182, 2006.
12. Y. Nagata. New EAX crossover for large TSP instances, Proceedings of the 9th International Conference on Parallel Problem Solving from Nature, LNCS, Vol. 4193, pp. 372-381, 2006.
13. A.P. Kindervater, W.P. Savelsbergh, Chapter 10 in Local Search in Combinatorial optimization, edited by E. Aarts and J.K. Lenstra, John Wiley & Son, 1997.
14. N. Christofides, A. Mingozzi, P. Toth. The vehicle routing problem. Chap. 11 in Combinatorial Optimization, edited by the same authors and C. Sandi, Wiley, 1979.
15. http://neo.lcc.uma.es/radi-aeb/WebVRP/