[1]Wardrop J G. Some theoretical aspects of road traffic research[J]. Proceedings of the Institute of Civil Engineers, 1952:1(3):325 -378.[2]Beckmann M, McGuire C B, Winsten C B. Studies in the economics of transportation[M]. New Haven, Connecticut: Yale University Press, 1956.[3]Leblance L J, Morlok E K, Pierskalla W. An efficient approach to solving the road network equilibrium traffic assignment problem [J]. Transportation Research, 1975, 9(5): 309318.[4]Boyce D, RalevicDekic B, BarGera H. Convergence of traffic assignments: How much is enough? [J]. Journal of Transportation Engineering, 2004,130(1): 4955.[5]Slavin H B, Rabinowicz A. An empirical comparison of alternative user equilibrium traffic assignment methods[DB/CD]. Strasbourg: Association for European Transport and contributors, 2006.[6]Daneva M, Lindberg P O. A conjugate direction FrankWolfe method with applications to the traffic assignment problems[C]// International Conference on Operations Research 2002. New York: Springer,2002:133138.[7]BarGera H. Originbased algorithm for the traffic assignment problem[J]. Transportation Science,2002,36(4):398417.[8]Dial R B. A pathbased userequilibrium traffic assignment algorithm that obviates path storage and enumeration[J]. Transportation Research Part B, 2006: 40(10): 917936.[9]Florian M. New look at projected gradient method for equilibrium assignment[DB/CD]. Washington: Transportation Research Board, 2009.[10]Chen D H, Jayakrishnan L R. Computational study of stateoftheart pathbased traffic assignment algorithms[J]. Mathematics and Computers in Simulation,2002,59: 509518.[11]Gentile G. Linear user cost equilibrium: A new algorithm for traffic assignment[DB/CD]. Washington: Transportation Research Board, 2008.[12]Marco Y N. A class of bushbased algorithms for the traffic assignment problem[J]. Transportation Research Part B, 2010: 44(1): 7389. |