A powerful route minimization heuristic for the vehicle routing problem with time windows

  • 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, FI-40014 University of Jyväskylä, Finland

  • Venue:
  • Operations Research Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger's benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.