Solving variants of the vehicle routing problem with a simple parallel iterated Tabu search

  • Authors:
  • Mirko Maischberger;Jean-François Cordeau

  • Affiliations:
  • Global Optimization Laboratory and DSI, Università degli Studi di Firenze, Firenze, Italy;Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montráal, Montréal, Canada

  • Venue:
  • INOC'11 Proceedings of the 5th international conference on Network optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.02

Visualization

Abstract

We introduce a parallel iterated tabu search heuristic for solving eight different variants of the vehicle routing problem. Through extensive computational results we show that the proposed heuristic is both general and competitive with specific heuristics designed for each problem type.