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

  • Authors:

  • Yuichi Nagata;Olli Bräysy

  • Affiliations:

  • Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, 4259 Nagatsuta Midori-ku Yokohama, Kanagawa 226-8502, Japan;Agora Innoroad Laboratory, Agora Center, P.O. Box 35, University of Jyväskylä, FI-40014, Finland

  • Venue:
  • Networks - Route 2007
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g., depots, warehouses) to efficiently service a number of demand or supply points. In this article a new memetic algorithm is suggested for the standard capacitated vehicle routing problem. The proposed algorithm combines the edge assembly (EAX) crossover with well-known local searches and allows for infeasible solutions with respect to capacity and route duration constraints after invoking the crossover. To address the constraint violation, an efficient modification algorithm is also suggested. Experimental tests on 47 standard benchmarks demonstrate that the suggested method is robust and competitive, finding new best-known solution to 20 well-studied instances and repeating the existing best-known solution for 24 problems in a reasonable computing time. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009