A BRANCH-AND-BOUND ALGORITHM FOR THE ASYMMETRICAL DISTANCE-CONSTRAINED VEHICLE-ROUTING PROBLEM

被引：35
作者：
LAPORTE, G
NOBERT, Y
TAILLEFER, S
机构：
[1] ECOLE HAUTES ETUD COMMERCIALES MONTREAL, MONTREAL H3T 1V6, QUEBEC, CANADA
[2] UNIV QUEBEC, DEPT SCI ADM, MONTREAL H3C 3P8, QUEBEC, CANADA
来源：
MATHEMATICAL MODELLING | 1987年 / 9卷 / 12期
关键词：
D O I：
10.1016/0270-0255(87)90004-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：857 / 868
页数：12
相关论文
共 23 条
[1]  
[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[2]  
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[3]   CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[4]   SOLUTION OF THE ASSIGNMENT PROBLEM [H] [J].
CARPANETO, G ;
TOTH, P .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (01) :104-111
[5]   SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].
CARPANETO, G ;
TOTH, P .
MANAGEMENT SCIENCE, 1980, 26 (07) :736-743
[6]   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
[7]   STATE-SPACE RELAXATION PROCEDURES FOR THE COMPUTATION OF BOUNDS TO ROUTING-PROBLEMS [J].
CHRISTOFIDES, N ;
MINGOZZI, A ;
TOTH, P .
NETWORKS, 1981, 11 (02) :145-164
[8]  
Christofides N., 1979, Combinatorial optimization, P315
[9]   ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMS [J].
CHRISTOFIDES, N ;
EILON, S .
OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (04) :511-+
[10]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
123