COMPUTATIONAL EXPERIMENTS WITH ALGORITHMS FOR A CLASS OF ROUTING-PROBLEMS

被引:192
作者
GOLDEN, BL
DEARMON, JS
BAKER, EK
机构
[1] MITRE CORP, MCLEAN, VA 22101 USA
[2] UNIV MIAMI, SCH BUSINESS ADM, DEPT MANAGEMENT SCI, MIAMI, FL 33146 USA
关键词
D O I
10.1016/0305-0548(83)90026-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
引用
收藏
页码:47 / 59
页数:13
相关论文
共 12 条
[1]  
Beltrami EJ, 1974, NETWORKS, V4, P65, DOI DOI 10.1002/NET.3230040106
[2]   CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[3]   EXACT ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM, BASED ON SPANNING TREE AND SHORTEST-PATH RELAXATIONS [J].
CHRISTOFIDES, N ;
MINGOZZI, A ;
TOTH, P .
MATHEMATICAL PROGRAMMING, 1981, 20 (03) :255-282
[4]  
Christofides N., 1973, Omega, V1, P719, DOI 10.1016/0305-0483(73)90089-3
[5]  
DEARMON JS, 1981, THESIS U MARYLAND CO
[6]  
DERIGS U, 1979, 2 METHODS SOLVING MI
[7]  
Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113
[8]   IMPLEMENTING VEHICLE ROUTING ALGORITHMS [J].
GOLDEN, BL ;
MAGNANTI, TL ;
NGUYEN, HQ .
NETWORKS, 1977, 7 (02) :113-148
[9]   CAPACITATED ARC ROUTING-PROBLEMS [J].
GOLDEN, BL ;
WONG, RT .
NETWORKS, 1981, 11 (03) :305-315
[10]   COMBINATORIAL OPTIMIZATION AND VEHICLE FLEET PLANNING - PERSPECTIVES AND PROSPECTS [J].
MAGNANTI, TL .
NETWORKS, 1981, 11 (02) :179-213