AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM WITH PICKUP AND DELIVERY CUSTOMERS

被引：61

作者：

KALANTARI, B

HILL, AV

ARORA, SR

机构：

[1] UNIV MINNESOTA, SCH MANAGEMENT, MINNEAPOLIS, MN 55455 USA

[2] UNIV MINNESOTA, INST TECHNOL, MINNEAPOLIS, MN 55455 USA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1985年 / 22卷 / 03期

关键词：

D O I：

10.1016/0377-2217(85)90257-7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：377 / 386

页数：10

共 22 条

[1] AN EXACT ALGORITHM FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM [J].

BAKER, EK .

OPERATIONS RESEARCH, 1983, 31 (05) :938-945

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

BALAS, E ;

CHRISTOFIDES, N .

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

[3] TRANSFORMATION OF MULTISALESMEN PROBLEM TO STANDARD TRAVELLING SALESMAN PROBLEM [J].

BELLMORE, M ;

HONG, S .

JOURNAL OF THE ACM, 1974, 21 (03) :500-504

[4] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[5] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].

BELLMORE, M ;

MALONE, JC .

OPERATIONS RESEARCH, 1971, 19 (02) :278-&

[6]

Burkard R.E., 1979, DISCRETE OPTIM, V4, P193

[7]

Christofides N., 1979, Combinatorial optimization, P315

[8]

CHRISTOFIDES N, 1976, APR S NEW DIR REC RE

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

CLARKE, G ;

WRIGHT, JW .

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

[10]

EASTMAN WL, 1958, THESIS HARVARD

← 1 2 3 →