Adaptation of the paired combinatorial logit model to the route choice problem

Transportmetrica

Volumn 1, Issue 3, 2005, Pages 223-240

  Pravinvongvuth, Surachet ^a   Chen, Anthony ^a  

^a Utah State University   (United States)

Author keywords

Multinomial logit; Paired combinatorial logit model; Route choice

Indexed keywords

EID: 85009569226     PISSN: 18128602     EISSN: None     Source Type: Journal    
DOI: 10.1080/18128600508685649     Document Type: Article

References (52)

1. Bekhor, S., Ben-Akiva, M.E. and Ramming, M.S. (2002) Adaptation of logit kernel to route choice situation. Paper presented at the 81th Annual Meeting of the Transportation Research Board, Washington, D.C.
2. Bekhor, S. and Prashker, J.N. (1999) Formulations of extended logit stochastic user equilibrium assignments. Proceedings of the 14th International Symposium on Transportation and Traffic Theory, Jerusalem, Israel, pp. 351-372.
3. Bekhor, S. and Prashker, J.N. (2001) A stochastic user equilibrium formulation for the generalized nested logit model. Paper presented at the 80th Annual Meeting of the Transportation Research Board, Washington, D.C.
4. Bell, M.G.H. (1994) A simple alternative to Dial’s logit assignment algorithm. Transportation Research B, 29, 369-386.
5. Bell, M.G.H., Lam, W.H.K., Ploss, G. and Inaudi, D. (1993) Stochastic user equilibrium assignment and iterative balancing. Proceedings of the 12th International Symposium on Transportation and Traffic Theory, University of California, Berkeley.
6. Ben-Akiva, M., Bergman, M.J., Daly, A.J. and Ramaswamy, R. (1984) Modeling inter urban route choice behavior. Proceedings of the 9th International Symposium on Transportation and Traffic Theory, VNU Science Press.
7. Ben-Akiva, M. and Lerman, S.R. (1985) Discrete Choice Analysis: Theory and Application to Travel Demand. The MIT Press, Cambridge, Massachusetts.
8. Ben-Akiva, M. and Bierlaire, M. (1999) Discrete choice methods and their applications to short term travel decisions. In Hall, R.W. (ed.) Handbook of Transportation Science, Kluwer Publishers.
9. Bovy, P.H.L. (1996) Stochastic traffic assignment technique enhancements for congested networks. Transportation Modelling for Tomorrow. Delft University Press, The Netherlands.
10. Bovy, P.H.L. and Stern, E. (1990) Route Choice: Wayfinding in Transport Networks Studies in Operational Science. Kluwer Academic Publishers, Dordrecht, The Netherlands.
11. Burrell, J.E. (1968) Multipath route assignment and its application to capacity restraint. Proceedings of the Fourth International Symposium on Transportation and Traffic Theory, Karlsruhe, Germany.
12. Cantarella, G.E. and Binetti, M. (1998) Stochastic equilibrium traffic assignment with value-of-time distributed among users. International Transactions in Operational Research, 31,107-128.
13. Cantarella, G.E. and Binetti, M. (2002) Stochastic assignment with gammit path choice models. In Patriksson, M. and Labbe, M. (eds) Transportation Planning: State-of-the-Art. Kluwer Academic Press, The Netherlands, pp. 53-67.
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. Proceedings of the International Symposium on Transportation and Traffic Theory, J.B. Lesort (ed.), Lyon, France, 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. Preprint of the 8th IFAC Symposium on Transportation Systems, Chania, Greece.
16. Cascetta, E., Russo, F., Viola, F.A. and Vitetta, A. (2002) A model of route perception in urban road networks. Transportation Research B, 36, 577-592.
17. Chen, A. and Ji, Z. (2002) A comprehensive review of route choice models. Proceedings of the 7th Hong Kong Society of Transportation Studies Conference: Transportation in the Information Age, Hong Kong, P.R. China, D.G. Wang, and S.-M. Li (eds), pp. 335-344.
18. Chen, A. and Recker, W. (2001) Considering risk taking behavior in travel time reliability. Paper presented at the 80th Annual Meeting of the Transportation Research Board, Washington, D.C., USA.
19. 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.
20. Chen, M. and Alfa, A.S. (1991) Algorithms for solving Fisk’s stochastic traffic assignment model. Transportation Research B, 25, 405-412.
21. Chu, C. (1989) A paired combinatorial logit model for travel demand analysis. Proceedings of the Fifth World Conference on Transportation Research, pp. 295-309.
22. Daganzo, C. and Sheffi, Y. (1977) On stochastic models of traffic assignment. Transportation Research B, 14, 243-255.
23. Damberg, O., Lundgren, J.T. and Patriksson, M. (1996) An algorithm for the stochastic user equilibrium problem. Transportation Research B, 30, 115-131.
24. Dial, R. (1971) A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Research 5, 83-111.
25. Fisk, C. (1980) Some developments in equilibrium traffic assignment. Transportation Research B, 14, 243-255.
26. Gliebe, J.P., Koppleman, F.S. and Ziliaskopoulos, A. (1999) Route choice using a paired combinatorial logit model. Paper presented at the 78th Annual Meeting of the Transportation Research Board, Washington, D.C.
27. Huang, H.-J. and Bell, M.G.H. (1998) A study on logit assignment algorithm which excludes all cyclic flows. Transportation Research B, 32, 401-412.
28. Koppelman, F.S. and Wen, C.H. (2000) The paired combinatorial logit model: properties, estimation and application. Transportation Research B, 34, 75-89.
29. Leurent, F.M. (1997) Curbing the computational difficulty of the logit equilibrium assignment model. Transportation Research B, 31, 315-326.
30. Maher, M. (1998) Algorithms for logit-based stochastic user equilibrium assignment. Transportation Research B, 32, 539-549.
31. Maher, M. and Hughes, P. (1997) A probit based stochastic user equilibrium assignment problem. Transportation Research B, 31, 341-355.
32. McFadden, D. (1978) Modeling the choice of residential location. In Karlqvist, A., Lundquist, L., Snickkars, F. and Weibull, J. (eds), Spatial Interaction Theory and Residential Location, North Holland: Amsterdam, pp. 75-96.
33. Reprinted In Quigley, J. (ed) (1997) The Economics of Housing, Vol. 1, Edward Elgar: London, pp. 531-552.
34. McFadden, D. and Train, K. (2000) Mixed MNL models for discrete response. Journal of Applied Econometrics, 15, 447-470.
35. Mirchandani, P. and Soroush, H. (1987) Generalized traffic equilibrium with probabilistic travel times and perceptions. Transportation Science, 21, 133-152.
36. Nielsen, O.A. (1997) On the distributions of the stochastic components in SUE traffic assignment models. Paper presented at the 25th European Transport Forum (PTRC Annual Meeting), London.
37. Papola, A. (2004) Some developments on the cross-nested logit model. Transportation Research B, 38, 833-851.
38. Prashker, J.N. and Bekhor, S. (1998) Investigation of stochastic network loading procedures. Transportation Research Record, 1645, 94-102.
39. Prashker, J.N. and Bekhor, S. (2000) Congestion, stochastic and similarity effects in stochastic user equilibrium models. Transportation Research Record, 1733, 80-87.
40. Prashker, J.N. and Bekhor, S. (2004) Route choice models used in the stochastic user equilibrium problem: A review. Transport Reviews, 24, 437-463.
41. Ramming, M.S. (2002) Network knowledge and route choice. Ph.D. Dissertation, Department of Civil and Environmental Engineering, Massachusetts Institute of Technology.
42. Rosa, A. and Maher, M.J. (2002) Algorithms for solving the probit path-based stochastic user equilibrium traffic assignment problem with one or more user classes. In Taylor, M.A.P. (ed.) Proceedings of the 15th International Symposium on Transportation and Traffic Theory, Adelaide, Australia, pp.371-392.
43. Russo, F. and Vitetta, A. (2003) An assignment model with modified logit, which obviates enumeration and overlapping problems. Transportation, 30, 177-201.
44. Sheffi, Y. (1985) Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall, England Cliffs, New Jersey.
45. Sheffi, Y. and Powell, W. (1982) An algorithm for the equilibrium assignment problem with random link times. Networks, 12, 191-207.
46. Tatineni, M. (1996) Solution properties of stochastic route choice models. Ph.D. Dissertation, University of Illinois at Chicago.
47. Tatineni, M., Boyce, D.E. and Mirchandani, P. (1997) Comparisons of deterministic and stochastic traffic loading models. Transportation Research Record, 1607, 16-23.
48. Train, K. (2002) Discrete Choice Methods with Simulation. Cambridge University Press.
49. Von Falkenhausen, H. (1966) Traffic assignment by a stochastic model. Proceedings of the Fourth International Conference on Operational Research, pp. 415-421.
50. Vovsha, P. and Bekhor, S. (1998) The link nested logit model: overcoming the route overlapping problem. Transportation Research Record, 1645, 133-142.
51. Wardrop, J.G. (1952) Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers, Part II, 325-378.
52. Zhou, Z. and Chen, A. (2003) Stochastic traffic equilibrium problem: a comparison between length-based and congestion-based C-logit models. In B.P.Y. Loo and S.W.K. Lam (eds), Proceedings of the 8th Hong Kong Society of Transportation Studies Conference: Transportation & Logistics, Hong Kong, P.R. China, pp. 244-253.