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

Michael Polacek; Richard F. Hartl; Karl Doerner; Marc Reimann

doi:10.1007/s10732-005-5432-5

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 journal › Review article › peer-review

232 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 language	English
Pages (from-to)	613-627
Number of pages	15
Journal	Journal of Heuristics
Volume	10
Issue number	6
DOIs	https://doi.org/10.1007/s10732-005-5432-5
Publication status	Published - Dec 2004

Keywords

MDVRPTW
Metaheuristic
Multi Depot Vehicle Routing Problem with Time Windows
Variable Neighborhood Search
VNS

Access to Document

10.1007/s10732-005-5432-5

Cite this

@article{17f1b453f04c4100815110cf96f8de85,

title = "A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows",

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.",

keywords = "MDVRPTW, Metaheuristic, Multi Depot Vehicle Routing Problem with Time Windows, Variable Neighborhood Search, VNS",

author = "Michael Polacek and Hartl, \{Richard F.\} and Karl Doerner and Marc Reimann",

year = "2004",

month = dec,

doi = "10.1007/s10732-005-5432-5",

language = "English",

volume = "10",

pages = "613--627",

journal = "Journal of Heuristics",

issn = "1381-1231",

publisher = "Springer",

number = "6",

}

TY - JOUR

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

AU - Polacek, Michael

AU - Hartl, Richard F.

AU - Doerner, Karl

AU - Reimann, Marc

PY - 2004/12

Y1 - 2004/12

N2 - 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.

AB - 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.

KW - MDVRPTW

KW - Metaheuristic

KW - Multi Depot Vehicle Routing Problem with Time Windows

KW - Variable Neighborhood Search

KW - VNS

UR - https://www.scopus.com/pages/publications/14844361815

U2 - 10.1007/s10732-005-5432-5

DO - 10.1007/s10732-005-5432-5

M3 - Review article

AN - SCOPUS:14844361815

SN - 1381-1231

VL - 10

SP - 613

EP - 627

JO - Journal of Heuristics

JF - Journal of Heuristics

IS - 6

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this