A path-based algorithm for the cross-nested logit stochastic user equilibrium traffic assignment

Computer-Aided Civil and Infrastructure Engineering

Volumn 24, Issue 1, 2009, Pages 15-25

  Bekhor, Shlomo ^a   Toledo, Tomer ^a   Reznikova, Lena ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

CLOSED-FORM EQUATIONS; MULTINOMIAL LOGIT; OPTIMIZATION FORMULATIONS; REAL-SIZE NETWORKS; ROUTE CHOICE BEHAVIOR; ROUTE CHOICE MODEL; STOCHASTIC USER EQUILIBRIUM; TRAFFIC ASSIGNMENT;

STOCHASTIC SYSTEMS;

ALGORITHM; DECOMPOSITION ANALYSIS; LOGIT ANALYSIS; OPTIMIZATION; STOCHASTICITY; TRAFFIC MANAGEMENT;

EID: 57049162075     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2008.00563.x     Document Type: Article

References (26)

1. Akamatsu, T. (1996), Cyclic flows, Markov process and stochastic traffic assignment, Transportation Research Part B, 30 (5), 369-86.
2. Armijo, L. (1966), Minimization of functions having Lipschitz continuous first derivatives, Pacific Journal of Mathematics, 16, 1-3.
3. Azevedo, J. A., Santos Costa, M. E. O., Silvestre Madera, J. J. E. R. & Vieira Martins, E. Q. (1993), An algorithm for the ranking of shortest paths, European Journal of Operational Research, 69, 97-106.
4. Bekhor, S., Ben-Akiva, M. E. & Ramming, S. (2002), Adaptation of logit kernel to route choice situation, Transportation Research Record, 1805, 78-85.
5. Bekhor, S. & Prashker, J. N. (1999), Formulations of extended logit stochastic user equilibrium assignments, in A. Ceder (ed.), Proceedings of the 14th International Symposium on Transportation and Traffic Theory, Pergamon Press, 351-72.
6. Bekhor, S. & Prashker, J. N. (2001), Stochastic user equilibrium formulation for generalized nested logit model, Transportation Research Record, 1752, 84-90.
7. Bekhor, S., Reznikova, L. & Toledo, T. (2007), Application of the Cross Nested Logit Route Choice Model in Stochastic User Equilibrium Traffic Assignment, 88th Annual Meeting of the Transportation Research Board, January 2007, Washington DC.
8. Bell, M. G. H. (1995), Alternatives to dial's logit assignment algorithm, Transportation Research Part B, 29 (4), 287-95.
9. Ben-Akiva, M. E. & Bierlaire, M. (1999), Discrete choice methods and their applications to short-term travel decisions, in R. Hall (ed.), Handbook of Transportation Science, Kluwer, Dordrecht, 5-34.
10. Cascetta, E., Nuzzolo, A., Russo, F. & Vitetta, A. (1996), A modified logit route choice model overcoming path overlapping problems: Specification and some calibration results for interurban networks, in J. B. Lesort (ed.), Proceedings of the International Symposium on Transportation and Traffic Theory, Lyon, 697-711.
11. Chen, A., Kasikitwiwat, P. & Ji, Z. (2003), Solving the overlapping problem in route choice with paired combinatorial logit model, Transportation Research Record, 1857, 65-73.
12. Daganzo, C. F. & Sheffi, Y. (1977), On stochastic models of traffic assignment, Transportation Science, 11, 253-74.
13. Damberg, O., Lundgren, J. T. & Patriksson, M. (1996), An algorithm for the stochastic user equilibrium problem, Transportation Research Part B, 30, 115-31.
14. De La Barra, T., Perez, B. & Anez, J. (1993), Multidimensional path search and assignment, in Proceedings of the 21st PTRC Summer Annual Meeting, Manchester, England, 307-19.
15. Dial, R. B. (2001), Equilibrium Logit Traffic Assignment: Elementary Theory and Algorithm. Paper presented at the 80th Transportation Research Board Annual Meeting, Washington DC, 2001.
16. Fisk, C. (1980), Some developments in equilibrium traffic assignment, Transportation Research Part B, 14, 243-55.
17. Gliebe, J. P., Koppleman, F. S. & Ziliaskopoulos, A. (1999), Route choice using a paired combinatorial logit model, Preprints of the 78th Annual Meeting of the Transportation Research Board, Washington DC.
18. INRO Consultants. (1999), Emme/2 User's Manual: Release 9.2. Montréal.
19. Larsson, T., Migdalas, A., & Patriksson, M. (1993), A partial linearization algorithm for the traffic assignment problem, Optimization, 28, 47-61.
20. Larsson, T. & Patriksson, M. (1992), Simplicial decomposition with disaggregated representation for the traffic assignment problem, Transportation Science, 26 (1), 4-17.
21. Maher, M. (1998), Algorithms for logit-based stochastic user equilibrium assignment, Transportation Research Part B, 32 (8), 539-49.
22. Prashker, J. N. & Bekhor, S. (1998), Investigation of stochastic network loading procedures, Transportation Research Record, 1645, 94-102.
23. Prashker, J. N. & Bekhor, S. (2000), Congestion, stochastic, and similarity effects in stochastic user-equilibrium models, Transportation Research Record, 1733, 80-87.
24. Ramming, M. S. (2001), Network knowledge and route choice. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge.
25. Sheffi, Y. & Powell, W. B. (1982), An algorithm for the equilibrium assignment problem with random link times. Networks, 12, 191-207.
26. Vovsha, P. & Bekhor, S. (1998), The link nested logit model: Overcoming the route overlapping problem, Transportation Research Record, 1645, 133-42.