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

被引:74
作者
Cordeau, JF
Laporte, G
Mercier, A
机构
[1] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada
[2] Ecole Polytech Montreal, Gerad, Montreal, PQ, Canada
关键词
tabu search; multi-depot; periodic; site-dependent vehicle routings; time windows;
D O I
10.1057/palgrave.jors.2601707
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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 oil a set of benchmark instances of the multi-depot, the periodic and the site-dependent vehicle routing problems with time windows.
引用
收藏
页码:542 / 546
页数:5
相关论文
共 6 条
[1]  
Cordeau JF, 2002, SIAM MONOG DISCR MAT, P157
[2]   A unified tabu search heuristic for vehicle routing problems with time windows [J].
Cordeau, JF ;
Laporte, G ;
Mercier, A .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) :928-936
[3]  
Cordeau JF, 2001, INFOR, V39, P292
[4]  
POLACEK M, 2003, VARIABLE NEIGHBORHOO
[5]  
Savelsbergh M. W. P., 1992, ORSA Journal on Computing, V4, P146, DOI 10.1287/ijoc.4.2.146
[6]  
Toth P., 2002, SIAM MONOGRAPHS DISC