AN EXACT ALGORITHM FOR THE ASYMMETRICAL CAPACITATED VEHICLE-ROUTING PROBLEM

被引：93

作者：

LAPORTE, G ^{[1
]}

MERCURE, H ^{[1
]}

NOBERT, Y ^{[1
]}

机构：

[1] UNIV QUEBEC, DEPT SCI ADM, MONTREAL H3C 3P8, QUEBEC, CANADA

来源：

NETWORKS | 1986年 / 16卷 / 01期

关键词：

D O I：

10.1002/net.3230160104

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：33 / 46

页数：14

共 20 条

[1] A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM [J].

BALAS, E ;

CHRISTOFIDES, N .

MATHEMATICAL PROGRAMMING, 1981, 21 (01) :19-46

[2]

BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [DOI 10.1007/BF01386316, DOI 10.1007/S10287-004-0020-Y]

[3]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[4] SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].

CARPANETO, G ;

TOTH, P .

MANAGEMENT SCIENCE, 1980, 26 (07) :736-743

[5] 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

[6] 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

[7]

CHRISTOFIDES N, 1976, REV FR AUTOMAT INFOR, V10, P55

[8] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[9]

Fleischmann B., 1982, 11 INT S MATH PROGR

[10]

GAVISH B, 1979, 7905 U ROCH GRAD SCH

← 1 2 →