Article ID: | iaor1998297 |
Country: | United States |
Volume: | 31 |
Issue: | 2 |
Start Page Number: | 170 |
End Page Number: | 186 |
Publication Date: | May 1997 |
Journal: | Transportation Science |
Authors: | Potvin Jean-Yves, Gendreau Michel, Taillard ric D., Badeau Philippe, Guertin Franois |
Keywords: | vehicle routing & scheduling |
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.