MINIMUM ROUTE PROBLEM FOR NETWORKS WITH TURN PENALTIES AND PROHIBITIONS

被引：48

作者：

KIRBY, RF

POTTS, RB

机构：

[1] Planning Research Corporation, Washington, DC

[2] Mathematics Department, University of Adelaide, SA

来源：

TRANSPORTATION RESEARCH | 1969年 / 3卷 / 03期

关键词：

D O I：

10.1016/S0041-1647(69)80022-5

中图分类号：

TU [建筑科学];

学科分类号：

0813 ;

摘要：

[No abstract available]

引用

页码：397 / &

共 16 条

[1]

Bellman Richard, 1958, Quarterly of applied mathematics, V16, P87, DOI 10.1090/qam/102435

[2] A DIRECTIONALLY ORIENTED SHORTEST PATH ALGORITHM [J].

BUTAS, LF .

TRANSPORTATION RESEARCH, 1968, 2 (03) :253-&

[3] ON FINDING MINIMUM ROUTES IN A NETWORK WITH TURN PENALTIES [J].

CALDWELL, T .

[4]

DREYFUS SE, 1967, RM5433PR RAND MEM

[5]

KIRBY RF, 1966, 3RD P AUSTR ROAD R 1, P434

[6]

KIRBY RF, 1968, THESIS U ADELAIDE

[7]

MARTIN BV, 1961, MIT3 REP

MORI, M ;

NISHIMUR.T .

TRANSPORTATION RESEARCH, 1967, 1 (02) :165-&

[9]

MURCHLAND JD, 1968, TRANSPORT RES, V2, P295

[10]

MURCHLAND JD, 1967, LSETNT6 LOND SCH EC