Effects of choice set size and route choice models on path-based traffic assignment

Transportmetrica

Volumn 4, Issue 2, 2008, Pages 117-133

  Bekhor, Shlomo ^a   Toledo, Tomer ^a   Prashker, Joseph N ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Path based algorithms; Route choice; Stochastic user equilibrium; Traffic assignment

Indexed keywords

EID: 49049114133     PISSN: 18128602     EISSN: None     Source Type: Journal    
DOI: 10.1080/18128600808685682     Document Type: Article

References (47)

1. Akamatsu, T. (1996) Cyclic flows, Markov process and stochastic traffic assignment. Transportation Research Part B, 30, 369-386.
2. Azevedo, J.A., Santos Costa, M.E.O., Silvestre Madera, J.J.E.R., and Vieira Martins, E.Q. (1993) An algorithm for the ranking of shortest paths. European Journal of Operational Research, 69, 97-106.
3. Bar-Gera, H. and Boyce, D. (2005) User-equilibrium route set analysis of a large road network. In H.S. Mahmassani (ed.), Transportation and Traffic Theory, Proceedings of the 16th International Symposium on Transportation and Traffic Theory, Elsevier Science, Oxford, pp. 673-692.
4. Bell, M.G.H. (1995) Alternatives to Dial’s logit assignment algorithm. Transportation Research Part B, 29, 287-295.
5. Bekhor, S. and Prashker, J.N. (1999) Formulations of extended logit stochastic user equilibrium assignments. In A. Ceder (ed.), Transportation and Traffic Theory, Proceedings of the 14th International Symposium on Transportation and Traffic Theory, Pergamon Press, pp. 351-372.
6. Bekhor, S. and Prashker, J.N. (2001) Stochastic user equilibrium formulation for the generalized nested logit model. Transportation Research Record, 1752, 84-90.
7. Bekhor, S. and Toledo, T. (2005) Investigation of path-based algorithms for the stochastic user equilibrium problem. Transportation Research Part B, 39, 279-295.
8. Bekhor, S., Ben-Akiva, M.E. and Ramming, M.S. (2002) Adaptation of logit kernel to route choice situation. Transportation Research Record, 1805, 78-85.
9. Bekhor, S., Ben-Akiva, M.E. and Ramming, M.S. (2006) Evaluation of choice set generation algorithms for route choice models. Annals of Operations Research, 144, 235-247.
10. Bekhor, S., Toledo, T. and Reznikova, L. (2007) Application of the cross nested logit route choice model in stochastic user equilibrium traffic assignment. Transportation Research Record, 2003, 41-49.
11. Ben-Akiva, M.E. and Bierlaire, M. (1999) Discrete choice methods and their applications to short term travel decisions. In Randolph W. Hall (ed.), Handbook of Transportation Science, Kluwer Academic Publishers, Norwell, MA, Chapter 2.
12. Ben-Akiva, M.E., Bergman, M.J., Daly, A.J. and Ramaswamy, R. (1984) Modeling inter-urban route choice behaviour. In J. Volmuller and R. Hamerslag (eds.), Proceedings of the Ninth International Symposium on Transportation and Traffic Theory, VNU Science Press, Utrecht, pp. 299-330.
13. Bovy, P. and Fiorenzo-Catalano, S. (2007) Stochastic route choice set generation: behavioral and probabilistic foundations. Transportmetrica, 3, 173-189.
14. Cascetta, E., Nuzzolo, A., Russo, F. and 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, Elsevier, Lyon, pp. 697-711.
15. Cascetta, E., Russo, F. and Vitetta, A. (1997) Stochastic user equilibrium assignment with explicit path enumeration: comparison of models and algorithms. In M. Papageorgiou and A. Pouliezos (eds.), Proceedings of the 8th IFAC Symposium on Transportation Systems, pp. 1078-1084.
16. Chen A., Kasikitwiwat, P. and Ji, Z. (2003) Solving the overlapping problem in route choice with paired combinatorial logit model. Transportation Research Record, 1857, 65-73.
17. Chu, C. (1989) A paired combinatorial logit model for travel demand analysis. Proceedings of the Fifth World Conference on Transportation Research, 4, Ventura, CA, pp. 295-309.
18. Daganzo, C.F. and Sheffi, Y. (1977) On stochastic models of traffic assignment. Transportation Science, 11, 253-274.
19. Damberg, O., Lundgren, J.T. and Patriksson, M. (1996) An algorithm for the stochastic user equilibrium problem. Transportation Research Part B, 30, 115-131.
20. De La Barra, T., Perez, B. and Anez, J. (1993) Multidimensional path search and assignment. Proceedings of the 21st PTRC Summer Annual Meeting, Manchester, England, pp. 307-319.
21. Dial, R.B. (1971) A probabilistic multipath traffic assignment algorithm which obviates path enumeration. Transportation Research, 5, 83-111.
22. Dial, R.B. (2000) Bicriterion traffic equilibrium: T2 mode, algorithm, software overview. Transportation Research Record, 1725, 54-62.
23. Dial, R.B. (2001) Equilibrium logit traffic assignment: elementary theory and algorithms. 80th Annual Meeting of the Transportation Research Board, Washington DC, January 2001.
24. Fiorenzo-Catalano, S. and Van der Zijpp, N.J. (2001) A forecasting model for inland navigation based on route enumeration. Proceedings of the European Transport Conference, PTRC Education and Research Services Ltd., London, pp. 1-11.
25. Fisk, C. (1980) Some developments in equilibrium traffic assignment. Transportation Research Part B, 14, 243-255.
26. Friedrich, M., Hofsah, I. and Wekeck, S. (2001) Timetable-based transit assignment using branch and bound. Transportation Research Record, 1752, 100-107.
27. Gliebe, J.P., Koppelman, F.S. and Ziliaskopoulos, A. (1999) Route choice using a paired combinatorial logit model. 78th Annual Meeting of the Transportation Research Board, Washington DC, January 1999.
28. Hoogendoorn-Lanser, S. (2005) Modelling travel behaviour in multi-modal networks. TRAIL Research School, The Netherlands, 2005.
29. Huang H.J. (1995) A combined algorithm for solving and calibrating the stochastic user equilibrium assignment model. Journal of the Operational Research Society, 46, 977-987.
30. Huang H.J., and Bell, M.G.H. (1998) A study on logit assignment which excludes all cyclic flows. Transportation Research Part B, 32, 401-412.
31. Larsson, T. and Patriksson, M. (1992) Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science, 26, 4-17.
32. Leblanc, L.J. (1973) Mathematical Programming algorithms for large scale network equilibrium and network design problems. Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
33. Maher, M. (1998) Algorithms for logit-based stochastic user equilibrium assignment. Transportation Research Part B, 32, 539-549.
34. McFadden, D. (1978) Modeling the choice of residential location. In A. Karlqvist et al. (eds.), Spatial Interaction Theory and Residential Location, North Holland, Amsterdam, pp. 75-96.
35. Park, D. and Rilett, L.R. (1997) Identifying multiple and reasonable paths in transportation networks: a heuristic approach. Transportation Research Record, 1607, 31-37.
36. Powell, W.B. and Sheffi, Y. (1982) The convergence of equilibrium algorithms with predetermined step sizes. Transportation Science, 16, 45-55.
37. Prashker, J.N. and Bekhor, S. (1998) Investigation of stochastic network loading procedures. Transportation Research Record, 1645, 94-102.
38. Prashker J.N., and Bekhor, S. (2004) Route choice models used in the stochastic user equilibrium problem: a review. Transport Reviews, 24, 437-463.
39. Prato, C.G. and Bekhor, S. (2006) Applying branch-and-bound technique to route choice set generation. Transportation Research Record, 1985, 19-28.
40. Pravinvongvuth, S. and Chen, A. (2005) Adaptation of the paired combinatorial logit model to the route choice problem. Transportmetrica, 1, 223-240.
41. Ramming, M.S. (2001) Network knowledge and route choice. Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge.
42. Scott, K., Pabon-Jimenez, G. and Bernstein, D. (1997) Finding alternatives to the best path. 76th Annual Meeting of the Transportation Research Board, Washington, DC, January 1997.
43. Sheffi, Y. and Powell, W.B. (1982) An algorithm for the equilibrium assignment problem with random link times. Networks, 12, 191-207.
44. Van der Zijpp, N.J. and Fiorenzo-Catalano, S. (2005) Path enumeration by finding the constrained k-shortest paths. Transportation Research Part B, 39, 545-563.
45. Vovsha, P. (1997) The cross-nested logit model: application to mode choice in the tel-aviv metropolitan area. Transportation Research Record, 1607, 6-15.
46. Wen, C.H. and Koppelman, F.S. (2001) The generalized nested logit model. Transportation Research Part B, 35, 627-641.
47. Yai, T., Iwakura, S. and Morichi, S. (1997) Multinomial probit with structured covariance for route choice behavior. Transportation Research Part B, 31, 195-207.