论文信息 - Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

This note introduces a refinement to a previously proposed tabu search algorithm for vehicle routing problems with time windows. This refinement yields new best known solutions on a set of benchmark instances of the multi-depot, the periodic and the site-dependent vehicle routing problems with time windows.

Gilbert Laporte | Jean-François Cordeau | Anne Mercier

[1] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[2] Jean-François Cordeau,et al. VRP with Time Windows , 1999, The Vehicle Routing Problem.

[3] Gilbert Laporte,et al. A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[4] Richard F. Hartl,et al. A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[5] Gilbert Laporte,et al. A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows , 2001 .