THE DISTANCE TRAVELED TO VISIT N-POINTS WITH A MAXIMUM OF C-STOPS PER VEHICLE - AN ANALYTIC MODEL AND AN APPLICATION

被引：198

作者：

DAGANZO, CF ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1287/trsc.18.4.331

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：331 / 350

页数：20

共 8 条

[1] BRUNS LD, OPNS RES
[2] THE LENGTH OF TOURS IN ZONES OF DIFFERENT SHAPES
DAGANZO, CF
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1984, 18 (02) : 135 - 145
[3] DAGANZO CF, UNPUB TRANS RES
[4] Eilon S., 1971, DISTRIBUTION MANAGEM
[5] A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING
FISHER, ML
JAIKUMAR, R
[J]. NETWORKS, 1981, 11 (02) : 109 - 124
[6] HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM
GILLETT, BE
MILLER, LR
[J]. OPERATIONS RESEARCH, 1974, 22 (02) : 340 - 349
[7] HAN A, 1982, UCBITSGR821 U CAL I
[8] Larson R., 1981, URBAN OPERATIONS RES