Details

Autor(en) / Beteiligte

• Taillard, Eric
• Badeau, Philippe
• Gendreau, Michel
• Guertin, Francois
• Potvin, Jean-Yves

Titel

A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

Ist Teil von

• Transportation science, 1997-05, Vol.31 (2), p.170-186

Ort / Verlag

Linthicum, MD: INFORMS

Erscheinungsjahr

1997

Link zum Volltext

Quelle

EBSCOhost Business Source Ultimate

Beschreibungen/Notizen

• This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. In this problem, lateness at customer locations is allowed although a penalty is incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the tabu search, a neighborhood of the current solution is created through an exchange procedure that swaps sequences of consecutive customers (or segments) between two routes. The tabu search also exploits an adaptive memory that contains the routes of the best previously visited solutions. New starting points for the tabu search are produced through a combination of routes taken from different solutions found in this memory. Many best-known solutions are reported on classical test problems.