BOUNDS AND HEURISTICS FOR CAPACITATED ROUTING-PROBLEMS

被引：229

作者：

HAIMOVICH, M ^{[1
]}

KAN, AHGR ^{[1
]}

机构：

[1] ERASMUS UNIV,3000 DR ROTTERDAM,NETHERLANDS

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1985年 / 10卷 / 04期

关键词：

D O I：

10.1287/moor.10.4.527

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：527 / 542

页数：16

共 21 条

[1]

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

[2] EXACT ALGORITHMS FOR THE VEHICLE-ROUTING PROBLEM, BASED ON SPANNING TREE AND SHORTEST-PATH RELAXATIONS [J].

CHRISTOFIDES, N ;

MINGOZZI, A ;

TOTH, P .

MATHEMATICAL PROGRAMMING, 1981, 20 (03) :255-282

[3]

CHRISTOFIDES N, UNPUB MATH PROGRAMMI

[4]

Christofides N., 1979, COMBINATORIAL OPTIMI

[5] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[6] ANALYTICAL EVALUATION OF HIERARCHICAL PLANNING SYSTEMS [J].

DEMPSTER, MAH ;

FISHER, ML ;

JANSEN, L ;

LAGEWEG, BJ ;

LENSTRA, JK ;

KAN, AHGR .

OPERATIONS RESEARCH, 1981, 29 (04) :707-716

[7]

DEMPSTER MAH, MATH OPER RES

[8]

Eilon S., 1971, DISTRIBUTION MANAGEM

[9]

Few L, 1955, MATHEMATIKA, V2, P141

[10]

Garey MR., 1979, COMPUTERS INTRACTABI

← 1 2 3 →