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

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

doi:10.1016/S0377-2217(02)00669-0

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

Original language	English
Pages (from-to)	369-387
Number of pages	19
Journal	European Journal of Operational Research
Volume	11
DOIs	https://doi.org/10.1016/S0377-2217(02)00669-0
Publication status	Published - 2003

Keywords

Metaheuristic
Threshold Accepting
Vehicle Routing Problem

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/S0377-2217(02)00669-0

http://www.mendeley.com/research/threshold-accepting-metaheuristic-vehicle-routing-problem-time-windows

Handle.net

Persistent link

Cite this

@article{fa0df249749943b9b2403e19f1720c31,

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

keywords = "Metaheuristic, Threshold Accepting, Vehicle Routing Problem",

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

year = "2003",

doi = "10.1016/S0377-2217(02)00669-0",

language = "English",

volume = "11",

pages = "369--387",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

}

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

Y1 - 2003

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

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

KW - Metaheuristic

KW - Threshold Accepting

KW - Vehicle Routing Problem

U2 - 10.1016/S0377-2217(02)00669-0

DO - 10.1016/S0377-2217(02)00669-0

M3 - Article

SN - 0377-2217

VL - 11

SP - 369

EP - 387

JO - European Journal of Operational Research

JF - European Journal of Operational Research

ER -

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

Abstract

Keywords

UN SDGs

Access to Document

Handle.net

Fingerprint

Cite this