On the vehicle routing problem

被引：0

作者：

Achuthan, NR ^{[1
]}

Caccetta, L ^{[1
]}

Hill, SP ^{[1
]}

机构：

[1] Curtin Univ Technol, Sch Math & Stat, Perth, WA 6001, Australia

来源：

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS | 1997年 / 30卷 / 07期

关键词：

branch and bound; branch and cut; combinatorial optimization; mixed-integer linear programming; vehicle routing; vehicle scheduling;

D O I：

10.1016/S0362-546X(97)00127-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

[No abstract available]

引用

页码：4277 / 4288

页数：12

共 12 条

[1] A new subtour elimination constraint for the vehicle routing problem [J].

Achuthan, NR ;

Caccetta, L ;

Hill, SP .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 91 (03) :573-586

[2]

ACHUTHAN NR, UNPUB IMPROVED BRANC

[3]

ACHUTHAN NR, UNPUB VEHICLE ROUTIN

[4]

ACHUTHAN NR, UNPUB COMP VEHICLE R

[5]

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

[6]

CHRISTOFIDES N, 1985, TRAVELING SALESMAN P, P431

[7] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY [J].

CROWDER, H ;

PADBERG, MW .

MANAGEMENT SCIENCE, 1980, 26 (05) :495-509

[8] OPTIMAL ROUTING UNDER CAPACITY AND DISTANCE RESTRICTIONS [J].

LAPORTE, G ;

NOBERT, Y ;

DESROCHERS, M .

OPERATIONS RESEARCH, 1985, 33 (05) :1050-1073

[9]

LAPORTE G, 1992, EJOR, V59, P213

[10] COMPLEXITY OF VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].

LENSTRA, JK ;

KAN, AHGR .

NETWORKS, 1981, 11 (02) :221-227

← 1 2 →