参考文献/References:
[1] Kirby R F,Potts R B.The minimum route problem for networks with turn penalties and prohibitions [J].Transportation Research,1969,3:397-408.
[2] Easa S M.Traffic assignment in practice:overview and guidelines for users [J]. Journal of Transportation Engineering, 1991,117(6):602-623.
[3] De La Barra T.Integrated land use and transport modeling [M].Cambridge:Cambridge Univ Press,1989.65-87.
[4] A(~overn)ez J,De La Barra T,Pérez B.Dual graph representation of transport networks [J].Transportation Research B, 1996,30(3):209-216.
[5] Caldwell T.On finding minimal routes in a network with turning penalties [J]. Communications of the ACM,1961,4(2):107-108.
[6] Ziliaskopoulos A K,Mahmassani H S.A note on least time path computation considering delays and prohibitions for intersection movements [J].Transportation Research B,1996,30(5):359-367.
[7] Pallottino S,Scutella M G.Shortest path algorithms in transportation models:Basemic Timesal and innovative aspects.[EB/OL].http://ftp.di.unipi.it/pub/techreports/TR-97-06.ps.Z.1997-06-25/2003-02-15.
[8] Cherkassky B V,Goldberg A V,Radzik T.Shortest paths algorithms:theory and experimental evaluation [R].Stanford:Computer Science Department,Stanford University,1993.