A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows.

Olli Bräysy; Jean Berger; Mohamed Barkaoui; Wout Dullaert

A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows.

Olli Bräysy, Jean Berger, Mohamed Barkaoui, Wout Dullaert

Amsterdam Business Research Institute

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

Threshold Accepting, a variant of Simulated, Annealing, is applied for the first time to a set of 356 benchmark instances for the Vehicle Routing with Time Windows. The Threshold Accepting metaheuristic is used to improve upon results obtained with a recent parallel genetic algorithm and a multi-start local search to illustrate its value as a post-processor. The Threshold Accepting metaheuristic is shown to be a fast and versatile post-processor that can be imposed upon a variety of heuristic or metaheuristic approaches for vehicle routing to get better results in both theoretical and practical application. [ABSTRACT FROM AUTHOR]

Original language	English
Pages (from-to)	369-387
Number of pages	19
Journal	Central European Journal of Operations Research
Volume	11
Issue number	4
Publication status	Published - Dec 2003

Keywords

ALGORITHMS
COMMUNICATIONS industries
COMPUTER programming
HEURISTIC
Metaheuristics
PROBABILITY theory
TRANSPORTATION
Threshold Accepting
Vehicle Routing

Access to Document

Persistent URL (handle)

Persistent link

Cite this

@article{cdf613453b5c468daaf2ec12cb99cb89,

title = "A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows.",

abstract = "Threshold Accepting, a variant of Simulated, Annealing, is applied for the first time to a set of 356 benchmark instances for the Vehicle Routing with Time Windows. The Threshold Accepting metaheuristic is used to improve upon results obtained with a recent parallel genetic algorithm and a multi-start local search to illustrate its value as a post-processor. The Threshold Accepting metaheuristic is shown to be a fast and versatile post-processor that can be imposed upon a variety of heuristic or metaheuristic approaches for vehicle routing to get better results in both theoretical and practical application. [ABSTRACT FROM AUTHOR]",

keywords = "ALGORITHMS, COMMUNICATIONS industries, COMPUTER programming, HEURISTIC, Metaheuristics, PROBABILITY theory, TRANSPORTATION, Threshold Accepting, Vehicle Routing",

author = "Olli Br{\"a}ysy and Jean Berger and Mohamed Barkaoui and Wout Dullaert",

year = "2003",

month = dec,

language = "English",

volume = "11",

pages = "369--387",

journal = "Central European Journal of Operations Research",

issn = "1435-246X",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows.

AU - Bräysy, Olli

AU - Berger, Jean

AU - Barkaoui, Mohamed

AU - Dullaert, Wout

PY - 2003/12

Y1 - 2003/12

N2 - Threshold Accepting, a variant of Simulated, Annealing, is applied for the first time to a set of 356 benchmark instances for the Vehicle Routing with Time Windows. The Threshold Accepting metaheuristic is used to improve upon results obtained with a recent parallel genetic algorithm and a multi-start local search to illustrate its value as a post-processor. The Threshold Accepting metaheuristic is shown to be a fast and versatile post-processor that can be imposed upon a variety of heuristic or metaheuristic approaches for vehicle routing to get better results in both theoretical and practical application. [ABSTRACT FROM AUTHOR]

AB - Threshold Accepting, a variant of Simulated, Annealing, is applied for the first time to a set of 356 benchmark instances for the Vehicle Routing with Time Windows. The Threshold Accepting metaheuristic is used to improve upon results obtained with a recent parallel genetic algorithm and a multi-start local search to illustrate its value as a post-processor. The Threshold Accepting metaheuristic is shown to be a fast and versatile post-processor that can be imposed upon a variety of heuristic or metaheuristic approaches for vehicle routing to get better results in both theoretical and practical application. [ABSTRACT FROM AUTHOR]

KW - ALGORITHMS

KW - COMMUNICATIONS industries

KW - COMPUTER programming

KW - HEURISTIC

KW - Metaheuristics

KW - PROBABILITY theory

KW - TRANSPORTATION

KW - Threshold Accepting

KW - Vehicle Routing

M3 - Article

SN - 1435-246X

VL - 11

SP - 369

EP - 387

JO - Central European Journal of Operations Research

JF - Central European Journal of Operations Research

IS - 4

ER -

A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows.

Abstract

Keywords

Access to Document

Persistent URL (handle)

Fingerprint

Cite this