A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Michael Polacek*, Richard F. Hartl, Karl Doerner, Marc Reimann

*Corresponding author for this work

Research output: Contribution to journalReview articlepeer-review

184 Citations (Scopus)

Abstract

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.

Original languageEnglish
Pages (from-to)613-627
Number of pages15
JournalJournal of Heuristics
Volume10
Issue number6
DOIs
Publication statusPublished - Dec 2004

Fingerprint

Dive into the research topics of 'A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows'. Together they form a unique fingerprint.

Cite this