THE HAMILTONIAN RHO-MEDIAN PROBLEM

被引：30

作者：

BRANCO, IM ^{[1
]}

COELHO, JD ^{[1
]}

机构：

[1] UNIV NOVA LISBOA,FAC ECON,P-1000 LISBON,PORTUGAL

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 47卷 / 01期

关键词：

Combinational optimisation; Hamiltonian p-median; p-median; travelling salesman;

D O I：

10.1016/0377-2217(90)90092-P

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper is concerned with a new mixed routing location problem embedding the p-median and the travelling salesman problems. The Hamiltonian p-median problem (HPMP) is formulated and several heuristics are proposed. Computational experience with a set of test problems is reported. © 1990.

引用

页码：86 / 95

页数：10

共 18 条

[1]

BRANCO IM, 1984, 17 U NOV LISB FAC EC

[2]

BRANCO IM, 1980, 6 U LISB CTR EST APL

[3]

BRANCO IM, 1983, 6 U NOV LISB FAC EC

[4]

BRANCO IM, 1984, 1084 U LISB CTR EST

[5]

Burness R. C., 1976, Transportation Science, V10, P348, DOI 10.1287/trsc.10.4.348

[6]

CERDEIRA JO, 1986, 1486 CTR EST APL NOT

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

CHRISTOF.N ;

EILON, S .

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

[8] THE PERIOD ROUTING PROBLEM [J].

CHRISTOFIDES, N ;

BEASLEY, JE .

NETWORKS, 1984, 14 (02) :237-256

[9] ONE-FACILITY LOCATION WITH RECTILINEAR TOUR DISTANCES [J].

DREZNER, Z ;

STEINER, G ;

WESOLOWSKY, GO .

NAVAL RESEARCH LOGISTICS, 1985, 32 (03) :391-405

[10]

FENEL Z, 1973, COMMUN ACM, V16, P572

← 1 2 →