Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization

Transportation Research Part B: Methodological

Volumn 46, Issue 8, 2012, Pages 1023-1042

  Xie, Chi ^a   Travis Waller, S ^b  

^a The University of Texas at Austin   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Lagrangian relaxation; Linearization method; Nonlinear duality; Stochastic traffic assignment; Unconstrained optimization

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONVEX OPTIMIZATION; LAGRANGE MULTIPLIERS; NONLINEAR PROGRAMMING; OPTIMIZATION; STOCHASTIC SYSTEMS;

LAGRANGIAN RELAXATION; LINEARIZATION METHODS; NONLINEAR DUALITY; STOCHASTIC TRAFFIC ASSIGNMENTS; UNCONSTRAINED OPTIMIZATION;

STOCHASTIC MODELS;

LAGRANGIAN ANALYSIS; NUMERICAL MODEL; OPTIMIZATION; STOCHASTICITY; TRAFFIC MANAGEMENT;

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

References (41)

1. Akamatsu T. Cyclic flows, Markov process and stochastic traffic assignment. Transportation Research Part B 1996, 30(5):369-386.
2. Bar-Gera H. Origin-based algorithm for the traffic assignment problem. Transportation Science 2002, 36(4):398-417.
3. Beckmann M., McGuire C.B., Winsten C.B. Studies in the Economics of Transportation 1956, Yale University Press, New Heaven, CT.
4. Bell M.G.H. Alternatives to Dial's logit assignment algorithm. Transportation Research Part B 1995, 29(4):287-295.
5. Burrell, J.E., 1968. Multiple route assignment and its application to capacity restraint. In: Proceedings of the 4th International Symposium on Transportation and Traffic Theory, Karlsruhe, West Germany.
6. Cantarella G.E. A general fixed-point approach to multi-mode multi-user equilibrium assignment with elastic demand. Transportation Science 1997, 31(2):107-128.
7. Carey M. The dual of the traffic assignment problem with elastic demands. Transportation Research Part B 1985, 19(3):227-237.
8. Chen M., Alfa A.S. Algorithms for solving Fisk's stochastic traffic assignment model. Transportation Research Part B 1991, 25(6):405-412.
9. Daganzo C.F. Unconstrained extremal formulation of some transportation equilibrium problems. Transportation Science 1982, 16(3):332-360.
10. Dial R.B. A probabilistic multipath traffic assignment problem which obviates path numeration. Transportation Research 1971, 5(2):83-111.
11. Dial R.B. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Research Part B 2006, 40(10):917-936.
12. Evans S.P. Derivation and analysis of some models for combining trip distribution and assignment. Transportation Research 1976, 10(1):37-57.
13. Fisk C. Some developments in equilibrium traffic assignment. Transportation Research Part B 1980, 14(3):243-255.
14. Florian M., Hearn D. Network equilibrium models and algorithms. Network Routing, Handbooks in Operations Research and Management Science, vol. 8 1995, Elsevier, Amsterdam, The Netherlands. M.O. Ball (Ed.).
15. Florian M., Constantin I., Florian D. A new look at the projected gradient method for equilibrium assignment. Transportation Research Record 2009, 2090:10-16.
16. Fukushima M. On the dual approach to the traffic assignment problem. Transportation Research Part B 1984, 18(3):235-245.
17. Gabriel S.A., Bernstein D. The traffic equilibrium problem with nonadditive path costs. Transportation Science 1997, 31(4):337-348.
18. Hall M.A., Peterson E.L. Traffic equilibria analyzed via geometric programming. Traffic Equilibrium Methods 1975, 53-105. Springer, New York, NY. M. Florian (Ed.).
19. Hearn D.W. The gap function of a convex program. Operations Research Letters 1982, 1(2):67-71.
20. Hearn D.W., Lawphongpanich S. A dual ascent algorithm for traffic assignment problems. Transportation Research Part B 1990, 24(6):423-430.
21. Hearn D.W., Lawphongpanich S., Nguyen S. Convex programming formulations of the asymmetric traffic assignment problem. Transportation Research Part B 1984, 18(4/5):357-365.
22. Jayakrishnan R., Tsai W.K., Prashker J.N., Pajadhyaksha S. Faster path-based algorithm for traffic assignment. Transportation Research Record 1993, 1443:75-83.
23. Larsson T., Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science 1992, 26(1):4-17.
24. Larsson T., Liu Z., Patriksson M. A dual scheme for traffic assignment problems. Optimization 1997, 42(4):323-358.
25. LeBlanc L.J., Morlok E.K., Pierskalla W. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Research 1975, 9(5):309-318.
26. Lee D.H., Meng Q., Deng W. Origin-based partial linearization method for the stochastic user equilibrium traffic assignment problem. Journal of Transportation Engineering 2010, 136(1):52-60.
27. Liu H.X., He X., He B. Method of successive weighted averages and self-regulated averaging schemes for solving stochastic user equilibrium problem. Networks and Spatial Economics 2009, 9(4):485-503.
28. Lo H.K., Chen A. Traffic equilibrium problem with route-specific costs: formulation and algorithms. Transportation Research Part B 2000, 34(6):493-513.
29. Maher M.J. Algorithms for logit-based stochastic user-equilibrium assignment. Transportation Research Part B 1998, 32(8):539-549.
30. Maher M.J., Hughes P.C. A probit-based stochastic user equilibrium assignment model. Transportation Research Part B 1997, 31(4):341-355.
31. Maher M.J. Stochastic user equilibrium assignment with elastic demand. Traffic Engineering and Control 2001, 42(5):163-167.
32. Maher M.J., Stewart K., Rosa A. Stochastic social optimum traffic assignment. Transportation Research Part B 2005, 39(8):753-767.
33. Meng Q., Lam W.H.K., Yang L. General stochastic user equilibrium traffic assignment problem with link capacity constraints. Journal of Advanced Transportation 2008, 42(4):429-465.
34. Nguyen S. An algorithm for the traffic assignment problem. Transportation Science 1974, 8(3):203-216.
35. Nguyen S. A unified approach to equilibrium methods for traffic assignment. Traffic Equilibrium Methods 1976, 148-182. Springer-Verlag, New York, NY.
36. Patriksson, M., 1994. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands.
37. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods 1985, Prentice-Hall, Englewood Cliffs, NJ.
38. Sheffi Y., Powell W.B. An algorithm for the equilibrium assignment problem with random link times. Networks 1982, 12(2):191-207.
39. Smith M.J. An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function. Transportation Research Part B 1983, 17(5):365-371.
40. Williams H.C.L. On the formation of travel demand models and economic evaluation measures of user benefits. Environmental Planning Part A 1977, 9(3):285-344.
41. Yang H., Huang H.J. The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transportation Research Part B 2004, 38(1):1-15.