Mathematical models and computational algorithms for probit-based asymmetric stochastic user equilibrium problem with elastic demand

Transportmetrica

Volumn 8, Issue 4, 2012, Pages 261-290

  Meng, Qiang ^a   Liu, Zhiyuan ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

asymmetric link travel time functions; computational algorithm; elastic demand; probit based stochastic user equilibrium; variational inequality

Indexed keywords

ASYMMETRIC LINKS; COMPUTATIONAL ALGORITHM; ELASTIC DEMAND; STOCHASTIC USER EQUILIBRIUM; VARIATIONAL INEQUALITIES;

ALGORITHMS; LOADING; MONTE CARLO METHODS; STOCHASTIC MODELS; TRAFFIC CONTROL; VARIATIONAL TECHNIQUES;

PROBLEM SOLVING;

EID: 84862195364     PISSN: 18128602     EISSN: None     Source Type: Journal    
DOI: 10.1080/18128601003736026     Document Type: Article

References (45)

1. Baillon, JB and Cominetti, R. 2008. Markovian traffic equilibrium. Mathematical Programming, 111: 33-56.
2. Bar-Gera, H. 2009. Transportation network test problems. Available from: http://www.bgu.ac.il/~bargera/tntp/ [Accessed 15 July 2009]
3. Bekhor, S and Toledo, T. 2005. Investigating path-based solution algorithms to the stochastic user equilibrium problem. Transportation Research Part B, 39(3): 279-295.
4. Bekhor, S, Toledo, T and Prashker, JN. 2006. Effects of choice set size and route choice models on path-based traffic assignment. Transportmetrica, 4(2): 117-133.
5. Bertsekas, DP and Gafni, EM. 1982. Projection methods for variational inequalities with application to the traffic assignment problem. Mathematical Programming Study, 17: 139-159.
6. Bertsekas, DP and Tsitsiklis, JN. 1989. Parallel and distributed computation, Upper Saddle River, NJ: Prentice-Hall.
7. Bell, MGH. 1995a. Stochastic user equilibrium assignment in networks with queues. Transportation Research Part B, 29: 125-137.
8. Bell, MGH. 1995b. Alternatives to Dial's logit assignment algorithm. Transportation Research Part B, 29: 287-295.
9. Cantarella, GE. 1997. A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand. Transportation Science, 31(2): 107-128.
10. Chen, A, Lo, HK and Yang, H. 2001. A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs. European Journal of Operational Research, 135: 27-41.
11. Connors, RD and Sumalee, A. 2009. A network equilibrium model with travelers' perception of stochastic travel times. Transportation Research Part B, 43: 614-624.
12. Connors, R, Sumalee, A and Watling, D. 2007. Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user-classes. Transportation Research Part B, 41: 593-615.
13. Dafermos, SC. 1982. Relaxation algorithms for the general asymmetric traffic equilibrium problem. Transportation Science, 16: 231-240.
14. Daganzo, CF. 1979. Multinomial probit: the theory and its application to demand forecasting, New York: Academic Press.
15. Daganzo, CF. 1982. Unconstrained extremal formulation of some transportation equilibrium problems. Transportation Science, 16: 332-360.
16. Daganzo, CF. 1983. Stochastic network equilibrium with multiple vehicle types and asymmetric, indefinite link cost Jacobians. Transportation Science, 17: 282-300.
17. Daganzo, CF and Sheffi, Y. 1977. On stochastic models of traffic assignment. Transportation Science, 11(3): 253-274.
18. Dial, RB. 1971. A probabilistic multipath traffic assignment algorithm which obviates path enumeration. Transportation Research, 5: 83-111.
19. Facchinei, F and Pang, JS. 2003. Finite-dimensional variational inequalities and complementarity problems, New York: Springer-Verlag.
20. Fisk, C. 1980. Some developments in equilibrium traffic assignment. Transportation Research Part B, 14: 243-255.
21. Fisk, C and Nguyen, S. 1982. Solution algorithms for network equilibrium models with asymmetric user costs. Transportation Science, 16(3): 361-381.
22. Florian, M and Spiess, H. 1982. The convergence of diagonalization algorithms for asymmetric network equilibrium problems. Transportation Research Part B, 16: 447-483.
23. He, BS and Liao, LZ. 2002. Improvements of some projection methods for monotone nonlinear variational inequalities. Journal of Optimization Theory and Applications, 112(1): 111-128.
24. Huang, HJ and Bell, MGH. 1998. A study on logit assignment which excludes all cyclic flows. Transportation Research Part B, 32: 401-412.
25. Johnson, RA and Wichern, DW. 2002. Applied multivariate statistical analysis, 5th, Upper Saddle River: Prentice-Hall.
26. Korpelevich, GM. 1976. The extragradient method for finding saddle points and other problems. Ekonomika Matematicheskie Metody, 12: 747-756.
27. Maher, MJ and Hughes, PC. 1997a. An algorithm for SUEED-stochastic user equilibrium with elastic demand. 8th IFAC symposium on transportation systems, June 1997, Chania, Crete
28. Maher, MJ and Hughes, PC. 1997b. A probit-based stochastic user equilibrium assignment model. Transportation Research Part B, 31(4): 341-355.
29. Maher, MJ and Zhang, X. 2000. Formulation and algorithms for the problem of stochastic user equilibrium assignment with elastic demand. 8th EURO working group meeting on transportation, 11-14 September 2000, Rome
30. Meng, Q, Lam, WHK and Yang, L. 2008. General stochastic user equilibrium traffic assignment problem with link capacity constraints. Journal of Advanced Transportation, 42: 429-465.
31. Nagurney, A. 1993. Network economics, a variational inequality approach, Dordrecht: Kluwer Academic.
32. Nagurney, A and Zhang, D. 1996. Projected dynamical systems and variational inequality with applications, Dordrecht: Kluwer Academic.
33. Patriksson, M. 1994. The traffic assignment problems: models and methods, Utrecht, The Netherlands: VSP.
34. Prashker, JN and Bekhor, S. 2004. Route choice models used in the stochastic user equilibrium problem: a review. Transport Reviews, 24: 437-436.
35. Powell, WB and Sheffi, Y. 1982. The convergence of equilibrium algorithms with predetermined step sizes. Transportation Science, 16: 45-55.
36. Rosa, A and Maher, MJ. 2002. Algorithms for solving the probit path-based SUE traffic assignment problem with one or more user classes. In: Transportation and traffic theory in the 21st century. Proceedings of the 15th ISTTT. 2002, University of South Australia. Adelaide, 371-392, 16-18 July 2002
37. Shao, H. 2008. Modelling rain effects on risk-taking behaviours of multi-user classes in road networks with uncertainty. Journal of Advanced Transportation, 42(3): 265-290.
38. Sheffi, Y. 1985. Urban transportation networks: equilibrium analysis with mathematical programming models, Englewood Cliffs, NJ: Prentice-Hall.
39. Sheffi, Y and Powell, WB. 1981. A comparison of stochastic and deterministic traffic assignment over congested networks. Transportation Research Part B, 15(1): 53-64.
40. Sheffi, Y and Powell, WB. 1982. An algorithm for the equilibrium assignment problem with random link times. Networks, 12(2): 191-207.
41. Watling, D. 1998. Perturbation stability of the asymmetric stochastic equilibrium assignment model. Transportation Research Part B, 32: 155-171.
42. Wong, SC. 1999. On the convergence of Bell's logit assignment formulation. Transportation Research Part B, 33: 609-616.
43. Yang, H. 1995. Heuristic algorithms for the bilevel origin-destination matrix estimation problem. Transportation Research Part B, 29: 231-244.
44. Zhou, Z and Chen, A. 2003. A self-adaptive scaling technique embedded in the projection traffic assignment algorithm. Journal of Eastern Asia Society for Transportation Studies, 5: 1647-1662.
45. Zhou, Z and Chen, A. 2008. Comparative analysis of three user equilibrium models under stochastic demand. Journal of Advanced Transportation, 42(3): 239-263.