METHODS FOR ROUTING WITH TIME WINDOWS

被引：20

作者：

DESROSIERS, J

SOUMIS, F

DESROCHERS, M

SAUVE, M

机构：

[1] Ecole des Hautes Etudes Commerciales, de Montreal, GERAD, Montreal, Que,, Can, Ecole des Hautes Etudes Commerciales de Montreal, GERAD, Montreal, Que, Can

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1986年 / 23卷 / 02期

关键词：

D O I：

10.1016/0377-2217(86)90243-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：236 / 245

页数：10

共 13 条

[1]

BELMORE, 1971, OPER RES, V19, P278

[2]

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

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

CARPANETO, G ;

TOTH, P .

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

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

[5]

DESROSIERS, 1983, RAIRO, V17, P1

[6]

DESROSIERS, 1985, COMPUTER SCHEDULING, V2

[7] ROUTING WITH TIME WINDOWS BY COLUMN GENERATION [J].

DESROSIERS, J ;

SOUMIS, F ;

DESROCHERS, M ;

GERAD .

NETWORKS, 1984, 14 (04) :545-565

[8] A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING [J].

FISHER, ML ;

JAIKUMAR, R .

NETWORKS, 1981, 11 (02) :109-124

[9]

LAND, 1973, FORTRAN CODES MATH P

[10]

Levin A, 1971, TRANSPORT SCI, V5, P232

← 1 2 →