Path relinking for the vehicle routing problem

  • Authors:
  • Sin C. Ho;Michel Gendreau

  • Affiliations:
  • Department of Informatics, University of Bergen, Bergen, Norway N-5020;Centre de recherche sur les transports and Département d'informatique et de recherche opérationnelle, Université de Montréal, Canada

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a tabu search heuristic with path relinking for the vehicle routing problem. Tabu search is a local search method that explores the solution space more thoroughly than other local search based methods by overcoming local optima. Path relinking is a method to integrate intensification and diversification in the search. It explores paths that connect previously found elite solutions. Computational results show that tabu search with path relinking is superior to pure tabu search on the vehicle routing problem.