Edge Assembly Crossover for the Capacitated Vehicle Routing Problem

  • Yuichi Nagata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)


We propose an evolutionary algorithm (EA) that applies to the capacitated vehicle routing problem (CVRP). The EA uses edge assembly crossover (EAX) which was originally designed for the traveling salesman problem (TSP). EAX can be straightforwardly extended to the CVRP if the constraint of the vehicle capacity is not considered. To address the constraint violation, the penalty function method with 2-opt and Interchange neighborhoods is incorporated into the EA. Moreover, a local search is also incorporated into the EA. The experimental results demonstrate that the proposed EA can effectively find the best-known solutions on Christofides benchmark. Moreover, our EA found ten new best solutions for Golden instances in a reasonable computation time.


Local Search Solution Candidate Travel Salesman Problem Travel Salesman Problem Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Yuichi Nagata
    • 1
  1. 1.Graduate School of Information Sciences, Japan Advanced Institute of Science and Technology 

Personalised recommendations