HEURISTIC ALGORITHM FOR VEHICLE-DISPATCH PROBLEM

被引：621

作者：

GILLETT, BE

MILLER, LR

机构：

[1] UNIV MISSOURI,ROLLA,MO 65401

[2] BOWLING GREEN STATE UNIV,BOWLING GREEN,OH 43402

来源：

OPERATIONS RESEARCH | 1974年 / 22卷 / 02期

关键词：

D O I：

10.1287/opre.22.2.340

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：340 / 349

页数：10

共 14 条

[1]

[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

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

BELLMORE, M ;

NEHAUSE.GL .

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

[3] AN ALGORITHM FOR VEHICLE-DISPATCHING PROBLEM [J].

CHRISTOF.N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (03) :309-&

[4]

Clark G., 1963, OPS RES, V11, P568

[5]

Dantzig GB, 1959, OPER RES, V12, P80

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

GASKELL, TJ .

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

[7]

HAYES R, 1967, 106 CARN I TECH MAN

[8] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

[9] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].

HELD, M ;

KARP, RM .

OPERATIONS RESEARCH, 1970, 18 (06) :1138-&

[10]

Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

← 1 2 →