A class of bush-based algorithms for the traffic assignment problem

Transportation Research Part B: Methodological

Volumn 44, Issue 1, 2010, Pages 73-89

 

^a Marco)   (United States)

Author keywords

Acyclicity; Bush based algorithm; User equilibrium traffic assignment

Indexed keywords

RESEARCH; TRANSPORTATION;

ACYCLICITY; BUILDING BLOCKES; NEWTON-TYPE ALGORITHMS; PRECISE SOLUTIONS; RELATIVE PERFORMANCE; SOLUTION TECHNIQUES; TRAFFIC ASSIGNMENT; TRAFFIC ASSIGNMENT PROBLEM;

COMBINATORIAL OPTIMIZATION;

ALGORITHM; EQUILIBRIUM; METHODOLOGY; NETWORK ANALYSIS; NUMERICAL MODEL; PERFORMANCE ASSESSMENT; TRAFFIC MANAGEMENT;

EID: 71549134277     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2009.06.005     Document Type: Article

References (33)

1. Armijo L. Minimization of functions having lipschitz continuous first partial derivatives. Pacific Journal of Mathematics 16 1 (1966) 1-3
2. Bar-Gera, H. 1999. Origin-based Algorithms for Transportation Network Modeling. Ph.D. Thesis, University of Illinois at Chicago.
3. Bar-Gera H. Origin-based algorithm for the traffic assignment problem. Transportation Science 36 4 (2002) 398-417
4. Beckmann M., McGuire C.B., and Winsten C.B. Studies in the Economics of Transportation (1956), Yale University Press, New Haven, Connecticut
5. Bertsekas D.P. On the Goldstein-Lvitin-Poljak gradient projection method. IEEE Transactions on Automatic Control AC-21 2 (1976) 174-184
6. Bertsekas D.P., and Gafni E.M. Projected newton methods and optimization of multicommondity flows. IEEE Transactions on Automatic Control AC-28 12 (1983) 1090-1096
7. Bertsekas D.P., Gafni E.M., and Gallager R.G. Second derivative algorithms for minimum delay distributed routing in networks. IEEE Transactions on Communications 32 8 (1984) 911-919
8. Boyce D., Ralevic-Dekic B., and Bar-Gera H. Convergence of traffic assignments: how much is enough?. Journal of Transportation Engineering 130 1 (2004) 49-55
9. Dafermos, S.C. 1968, Traffic Assignment and Resource Allocation in Transportation Networks. Ph.D. Thesis, Johns Hopkins University, Baltimore, MD.
10. Dafermos S.C. An extended traffic assignment model with applications to two-way traffic. Transportation Science 5 4 (1971) 366-389
11. Dafermos S.C., and Sparrow F.T. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards 73B (1969) 91-118
12. Dial R. Probabilistic Assignment: A Multipath Traffic Assignment Model which Obviates Path Enumeration vol. 2 (1970), University of Washington
13. Dial R.B. A probabilistic multipath assignment model that obviates path enumeration. Transportation Research 5 2 (1971) 83-111
14. Dial R.B. Minimal-revenue congestion pricing part I: a fast algorithm for the single-origin case. Transportation Research Part B 33 3 (1999) 189-202
15. Dial R.B. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Research Part B 40 10 (2006) 917-936
16. Florian M., and Hearn D. Network Routing. Handbooks in OR & MS vol. 8 (1995), Elsevier Science, Oxford, UK (Chapter Network Equilibrium Models and Algorithms, pp. 485-549)
17. Frank M., and Wolfe P. An algorithm for quadratic programming. Naval Research Logistics Quarterly 3 1-2 (1956) 95-110
18. Fukushima M. A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transportation Research Part B 18 2 (1985) 169-177
19. Gallager R.G. A minimum delay routing algorithm using distributed computation. IEEE Transactions on Communications 25 1 (1977) 73-85
20. Gibert, A. 1968. A method for the traffic assignment problem. Report LBS-TNT-95. London Business School, London.
21. Hearn D.W., Lawphongranich S., and Ventura J.A. Finiteness in restricted simplicial decomposition. Operations Research Letters 4 3 (1985) 125-130
22. Jayakrishnan R., Tsai W.K., Prashker J.N., and Rajadhyaksha S. A faster path-based algorithm for traffic assignment. Transportation Research Record 1443 (1994) 75-83
23. Larsson T., and Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science 26 1 (1992) 4-17
24. Leblanc L.J., Morlok E.K., and Pierskalla W.P. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Research 9 5 (1975) 309-318
25. Leventhal T., Nemhauser G., and Trotter L. A column generation algorithm for optimal traffic assignment. Transportation Science 7 2 (1973) 168-176
26. Newell G.F. Traffic flow on transportation networks. Transportation Studies vol. 5 (1980), MIT Press, Cambridge, MA
27. Nie Y. A Programmers Manual for Toolkit of Network Modeling (TNM) (2006), University of California, Davis
28. Nie Y. A note on bar-Geras algorithm for the origin-based traffic assignment problem. Transportation Science Under Review (2007)
29. Patriksson M. The Traffic Assignment Problem: Models and Methods (1994), The Netherlands, Utrecht
30. Rheinboldt W.C. Methods for Solving Systems of Nonlinear Equations. Second ed. (1998), Society for Industrial and Applied Mathematics
31. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (1985), Prentice Hall, Englewood cliffs, NJ
32. Slavin, H., Brandon, J., Rabinowicz, A. 2006. An empirical comparison of alternative user equilibrium traffic assignment methods. In: Europose Transport Conference, Strasbourg.
33. Wardrop J.G. Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers 1 Part II (1952) 325-378