ANALYSIS OF AN O(N2) HEURISTIC FOR THE SINGLE VEHICLE MANY-TO-MANY EUCLIDEAN DIAL-A-RIDE PROBLEM

被引：50

作者：

PSARAFTIS, HN

机构：

来源：

关键词：

D O I：

10.1016/0191-2615(83)90041-3

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

引用

页码：133 / 145

页数：13

共 32 条

[1]

BAKER E, 1981, ALGORITHM VEHICLE RO

[2]

Beardwood J., 1959, P CAMBRIDGE PHILOS S, V55, P229

[3]

BODIN L, 1981, MSS81035 U MAR WORK

[4]

BODIN L, 1980, NOV ORSA TIMS M COL

[5]

CHRISTOFIDES N, 1980, 4 EUR C CAMBR

[6]

CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

DAGANZO, CF .

TRANSPORTATION RESEARCH, 1978, 12 (05) :325-333

[8]

Eilon S., 1971, DISTRIBUTION MANAGEM

[9]

FREDERICKSON UN, 1977, APPROXIMATION ALGORI

[10]

GAVISH B, 1979, MATH FORMULATIONS DI