THE GENERAL PICKUP AND DELIVERY PROBLEM

被引：609

作者：

SAVELSBERGH, MWP ^{[1
]}

机构：

[1] EINDHOVEN UNIV TECHNOL,5600 MB EINDHOVEN,NETHERLANDS

来源：

TRANSPORTATION SCIENCE | 1995年 / 29卷 / 01期

关键词：

D O I：

10.1287/trsc.29.1.17

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. lit this paper, we discuss several characteristics that distinguish them from standard vehicle routing problems and present a survey of the problem types and solution methods found in the literature.

引用

页码：17 / 29

页数：13

共 39 条

[1]

Beardwood J, 1959, P CAMBRIDGE PHILOS S, V55, P299, DOI [DOI 10.1017/S0305004100034095, 10.1017/S0305004100034095]

[2]

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

[3]

BODIN L, 1983, 83009 U MAR COLL PAR

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

Christofides N., 1976, 388 CARN MELL U GRAD

[6] SET PARTITIONING BASED HEURISTICS FOR INTERACTIVE ROUTING [J].

CULLEN, FH ;

JARVIS, JJ ;

RATLIFF, HD .

NETWORKS, 1981, 11 (02) :125-143

[7]

Desrochers M, 1988, VEHICLE ROUTING METH

[8] VEHICLE-ROUTING WITH FULL LOADS [J].

DESROSIERS, J ;

LAPORTE, G ;

SAUVE, M ;

SOUMIS, F ;

TAILLEFER, S .

COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (03) :219-226

[9]

Desrosiers J., 1986, American Journal of Mathematical and Management Sciences, V6, P301

[10]

DESROSIERS J, 1991, G9102 EC HAUT ET COM

← 1 2 3 4 →