A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows

Slim Belhaiza, Pierre Hansen, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

91 Citations (Scopus)

Abstract

This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. The implementation of the proposed heuristic is compared to an ant colony heuristic on benchmark instances involving multiple time windows. Computational results on newly generated instances are provided.

Original languageEnglish
Pages (from-to)269-281
Number of pages13
JournalComputers and Operations Research
Volume52
DOIs
Publication statusPublished - 1 Dec 2014

Keywords

  • Multiple time windows
  • Tabu search
  • Variable neighborhood search
  • Vehicle routing problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows'. Together they form a unique fingerprint.

Cite this