An algorithm for the stochastic user equilibrium problem

Transportation Research Part B: Methodological

Volumn 30, Issue 2, 1996, Pages 115-131

  Damberg, Olof ^a   Lundgren, Jan T ^a   Patriksson, Michael ^a  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES; TRANSPORTATION ROUTES;

LOGIT-BASED STOCHASTIC USER EQUILIBRIUM PROBLEM; TRAFFIC ASSIGNMENT PROBLEM;

HIGHWAY TRAFFIC CONTROL;

ALGORITHM; METHODOLOGICAL EVALUATION; ROUTE COSTING; STOCHASTIC USER EQUILIBRIUM; TRANSPORT PLANNING;

EID: 0030304231     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/0191-2615(95)00026-7     Document Type: Article

References (30)

1. Armijo L. (1966) Minimization of functions having Lipschitz continuous first partial derivatives. Pacif. J. Maths 16, 1-3.
2. Bazaraa M. S., Sherali H. D. and Shetty C. M. (1993) Nonlinear Programming. Theory and Algorithms (Second edition). Wiley, New York.
3. Beckmann M., McGuire C. B. and Winsten C. B. (1956) Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
4. Bell M. G. H., Lam W. H. K., Ploss G. and Inaudi D. (1993) Stochastic user equilibrium assignment and iterative balancing. Transportation and Traffic Theory, Proc. 12th Int. Symp. on the Theory of Traffic Flow and Transportation. Berkeley, CA, (Daganzo C. F. Ed.), pp. 427-439. Elsevier, Amsterdam.
5. Ben-Akiva M., Bergman M. J., Daly A. J. and Ramaswamy R. (1984) Modelling inter urban route choice behaviour. Proc. 9th Int. Symp. on Transportation and Traffic Theory, Delft, The Netherlands, (Volmuller J. and Hamerslag R. Eds), pp. 299-330. VNU Science Press, Utrecht, The Netherlands.
6. Bonsall P. (1992) The influence of route guidance advice on route choice in urban networks. Transportation 19, 1-23.
7. Burrell J. E. (1976) Multiple route assignment: a comparison of two methods. Traffic Equilibrium Methods, Proc. Int. Symp. Universite de Montréal. Lecture Notes in Economics and Mathematical Systems, (Florian M. A. Ed.), Vol. 118, pp. 229-239. Springer, Berlin.
8. Chen M. and Alfa A. S. (1991) Algorithms for solving Fisk's stochastic traffic assignment model. Transpn Res. 25B, 405-412.
9. Dafermos S. C. (1972) The traffic assignment problem for multiclass-user transportation networks. Transpn Sci. 6, 73-87.
10. Daganzo C. F. (1982) Unconstrained extremal formulation of some transportation equilibrium problems. Transpn Sci. 16, 332-360.
11. Daganzo C. F. and Sheffi Y. (1977) On stochastic models of traffic assignment. Transpn Sci. 11, 253-274.
12. Damberg O., Lundgren J. T. and Patriksson M. (1992) An algorithm for the stochastic user equilibrium problem. Proc. 1st Meeting of the EURO Working Group on Urban Traffic and Transportation, Landshut, Germany, (Banos J. C. M., Friedrich B., Papageorgiou M. and Keller H. Eds). Technical University of Munich.
13. Dial R. B. (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transpn Res. 5, 83-111.
14. Fisk C. (1980) Some developments in equilibrium traffic assignment. Transpn Res. 14B, 243-255.
15. Florian M. and Fox B. (1976) On the probabilistic origin of Dial's multipath traffic assignment model. Transpn Res. 10, 339-341.
16. Florian M. and Nguyen S. (1976) An application and validation of equilibrium trip assignment methods. Transpn Sci. 10, 374-390.
17. Hearn D. W., Lawphongpanich S. and Ventura J. A. (1987) Restricted simplicial decomposition: computation and extensions. Mathl Progm. Stud. 31, 99-118.
18. Jeffery D. (1987) Route guidance and in-vehicle information systems. Information Technology Applications in Transport, pp. 319-351. VNU Science Press, Utrecht.
19. Larsson T. and Patriksson M. (1992) Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transpn Sci. 26, 4-17.
20. LeBlanc L. J., Helgason R. V. and Boyce D. E. (1985) Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transpn Sci. 19, 445-462.
21. LeBlanc L. J., Morlok E. K. and Pierskalla W. P. (1975) An efficient approach to solving the road network equilibrium traffic assignment problem. Transpn Res. 9, 309-318.
22. Mimis S. (1984) Equilibrium traffic assignment models for urban networks. Master's thesis, Centre for Transportation Studies, Massachusetts Institute of Technology, Cambridge, MA.
23. Patriksson M. (1993) Partial linearization methods in nonlinear programming. J. Optimiz. Theory Applic. 78, 227-246.
24. Patriksson M. (1994) The Traffic Assignment Problem - Models and Methods. VSP, Utrecht, The Netherlands.
25. Powell W. B. and Sheffi Y. (1982) The convergence of equilibrium algorithms with predetermined step sizes. Transpn Sci. 16, 45-55.
26. Sheffi Y. (1985) Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, NJ.
27. Sheffi Y. and Powell W. B. (1981) A comparison of stochastic and deterministic traffic assignment over congested networks. Transpn Res. 15B, 53-64.
28. Sheffi Y. and Powell W. B. (1982) An algorithm for the equilibrium assignment problem with random link times. Networks 12, 191-207.
29. Van Vliet D. (1990) Modelling route guidance systems using SATURN. In DRIVE Project V1054 (ASTERIX) Deliverable 4, pp. B-83-B-105.
30. Wardrop J. G. (1952) Some theoretical aspects of road traffic research. Proc. Institute of Civil Engineers. Part II, pp. 325-378.