ON THE WORST-CASE PERFORMANCE OF SOME HEURISTICS FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOW CONSTRAINTS

被引:52
作者
SOLOMON, MM
机构
关键词
D O I
10.1002/net.3230160205
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:161 / 174
页数:14
相关论文
共 12 条
[1]   LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].
CORNUEJOLS, G ;
FISHER, ML ;
NEMHAUSER, GL .
MANAGEMENT SCIENCE, 1977, 23 (08) :789-810
[2]   TIGHT BOUNDS FOR CHRISTOFIDES TRAVELING SALESMAN HEURISTIC [J].
CORNUEJOLS, G ;
NEMHAUSER, GL .
MATHEMATICAL PROGRAMMING, 1978, 14 (01) :116-121
[3]   WORST-CASE ANALYSIS OF HEURISTIC ALGORITHMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1980, 26 (01) :1-17
[4]   ON THE WORST-CASE PERFORMANCE OF SOME ALGORITHMS FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].
FRIEZE, AM ;
GALBIATI, G ;
MAFFIOLI, F .
NETWORKS, 1982, 12 (01) :23-39
[5]  
Golden B. L., 1977, AIIE Transactions, V9, P204, DOI 10.1080/05695557708975144
[6]  
GRAHAM R, 1977, OPTIMIZATION APPROXI
[7]  
HAIMOVICH M, 1982, 492A COL U RES WORK
[8]   COMPLEXITY OF VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].
LENSTRA, JK ;
KAN, AHGR .
NETWORKS, 1981, 11 (02) :221-227
[9]  
Rosenkrantz D. H., 1977, SIAM Journal on Computing, V6, P563, DOI 10.1137/0206041
[10]  
SAVELSBERGH M, 1984, OSR8409 CTR MATH COM