2 EXACT ALGORITHMS FOR THE DISTANCE-CONSTRAINED VEHICLE-ROUTING PROBLEM

被引：73

作者：

LAPORTE, G ^{[1
]}

DESROCHERS, M ^{[1
]}

NOBERT, Y ^{[1
]}

机构：

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

来源：

NETWORKS | 1984年 / 14卷 / 01期

关键词：

D O I：

10.1002/net.3230140113

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：161 / 172

页数：12

共 27 条

[11]

Dnatizig Ramser, 1959, MANAGE SCI, V6, P81

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

FISHER, ML ;

JAIKUMAR, R .

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

[13] BASES FOR VEHICLE FLEET SCHEDULING [J].

GASKELL, TJ .

OPERATIONAL RESEARCH QUARTERLY, 1967, 18 (03) :281-&

[14]

GAVISH B, 1978, EUR J OPER RES, V3, P122

[15] HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM [J].

GILLETT, BE ;

MILLER, LR .

OPERATIONS RESEARCH, 1974, 22 (02) :340-349

[16] IMPLEMENTING VEHICLE ROUTING ALGORITHMS [J].

GOLDEN, BL ;

MAGNANTI, TL ;

NGUYEN, HQ .

NETWORKS, 1977, 7 (02) :113-148

[17]

GROTSCHEL M, 1980, MATH PROGRAM STUD, V12, P61

[18]

LAND AH, 1973, FORTRAN CODES MATH P

[19] AN EXACT ALGORITHM FOR MINIMIZING ROUTING AND OPERATING COSTS IN DEPOT LOCATION [J].

LAPORTE, G ;

NOBERT, Y .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 6 (02) :224-226

[20] A CUTTING PLANES ALGORITHM FOR THE M-SALESMEN PROBLEM [J].

LAPORTE, G ;

NOBERT, Y .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1980, 31 (11) :1017-1023

← 1 2 3 →