A comparison of shortest path algorithms in urban traffic assignment

被引：1

作者：

Salim, V

机构：

[1] Univ of Western Australia, Nedlands

来源：

关键词：

D O I：

10.1016/S0378-4754(97)00043-8

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：545 / 551

页数：7

共 7 条

[1]

DIAL RB, 291 CCS U TEX CTR CY

[2] IMPROVEMENTS FOR THE THRESH X2 SHORTEST-PATH ALGORITHM [J].

DIVOKY, JJ .

[3] PERFORMANCE OF SHORTEST-PATH ALGORITHMS IN NETWORK FLOW PROBLEMS [J].

DIVOKY, JJ ;

HUNG, MS .

GLOVER, F ;

KLINGMAN, DD ;

PHILLIPS, NV ;

SCHNEIDER, RF .

[5] A COMPUTATIONAL STUDY OF EFFICIENT SHORTEST-PATH ALGORITHMS [J].

HUNG, MS ;

DIVOKY, JJ .

[6] ALGORITHM 562 - SHORTEST-PATH LENGTHS [H] [J].

PAPE, U .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (03) :450-455

[7]

Sheffi Y., 1985, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods