Route choice modeling: Past, present and future research directions

Journal of Choice Modelling

Volumn 2, Issue 1, 2009, Pages 65-100

  Prato, Carlo Giacomo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Choice set generation; Discrete choice models; Route choice behavior; Substitution patterns

Indexed keywords

EID: 84869200631     PISSN: 17555345     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1755-5345(13)70005-8     Document Type: Article

References (119)

1. Akamatsu, T., 1996. Cyclic flows, Markov process and stochastic traffic assignment. Transportation Research Part B, 30(5), 369-386.
2. Akgün, V., Erkut, E., Batta, R., 2000. On finding dissimilar paths. European Journal of Operational Research, 121(2), 232-246. (Pubitemid 30531543)
3. Asakura, Y., Hato, E., 2004. Tracking survey for individual travel behaviour using mobile communication instruments. Transportation Research Part C, 12(3-4), 273-291. (Pubitemid 39364223)
4. 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(1), 97-106.
5. Bar-Gera, H., 2007. Evaluation of a cellular phone-based system for measurements of traffic speeds and travel times: a case study from Israel. Transportation Research Part C, 15(6), 380-391. (Pubitemid 47534989)
6. Basar,G., Bhat, C., 2004. A parameterized probabilistic consideration set model for airport choice: an application to the San Francisco Bay Area. Transportation Research Part B, 38(10), 889-904. (Pubitemid 39017073)
7. Bekhor, S., Ben-Akiva, M.E., Ramming, S., 2002. Adaptation of logit kernel to route choice situation. Transportation Research Record, 1805, 78-85.
8. Bekhor, S., Ben-Akiva, M.E., Ramming, S., 2006. Evaluation of choice set generation algorithms for route choice models. Annals of Operations Research, 144(1), 235-247. (Pubitemid 44286451)
9. Bekhor, S., Prashker, J.N., 2001. Stochastic user equilibrium formulation for the generalized nested logit model. Transportation Research Record, 1752, 84-90. (Pubitemid 34181178)
10. Bekhor, S., Prato, C.G., 2006. Effects of choice set composition in route choice modeling. Proceedings of the 11th International Conference on Travel Behavior Research, Kyoto, Japan.
11. Bekhor, S., Prato, C.G., 2009. Methodological transferability in route choice modeling. Transportation Research Part B, 43(4), 422-437.
12. Bekhor, S., Toledo, T., 2005. Investigating path-based solution algorithms to the stochastic user equilibrium problem. Transportation Research Part B, 39(3), 279-295. (Pubitemid 40058681)
13. Bekhor, S., Toledo, T., Prashker, J.N., 2006. Implementation issues of route choice models in path-based algorithms. Proceedings of the 11th International Conference on Travel Behavior Research, Kyoto, Japan.
14. Bell, M.G.H., 1995. Alternatives to Dial's logit assignment algorithm. Transportation Research Part B, 29(4), 287-295. (Pubitemid 26431359)
15. Bellman, R., 1958. On a routing problem. Quarterly of Applied Mathematics, 16 (1), 87-90.
16. Bellman, R., Kalaba, R., 1960. On k-th best policies. Journal of the Society for Industrial and Applied Mathematics, 8, 582-585.
17. Ben-Akiva, M.E., Bergman, M.J., Daly, A.J., Ramaswamy, R., 1984. Modeling inter-urban route choice behaviour. In: Volmuller, J., Hamerslag, R. (Eds.), Proceedings of the 9th International Symposium on Transportation and Traffic Theory. VNU Science Press, Utrecht, The Netherlands, 299-330.
18. Ben-Akiva, M.E., Bierlaire, M., 1999. Discrete choice methods and their applications to short term travel decisions. In: Hall, R.W. (Ed.), Handbook of Transportation Science. Kluwer, Dordrecht, The Netherlands, 5-34.
19. Ben-Akiva, M.E., Boccara, B., 1995. Discrete choice models with latent choice sets. International Journal of Research in Marketing, 12, 9-24.
20. Ben-Akiva, M.E., Bolduc, D., 1996. Multinomial probit with a logit kernel and a general parametric specification of the covariance structure. Working Paper, Massachusetts Institute of Technology, Cambridge, USA.
21. Ben-Akiva, M.E., Bolduc, D., Daly, A., 1993. Estimation of travel choice models with randomly distributed values of time. Transportation Research Record, 1413, 88-97.
22. Benjamins, M., Lindveld, K., Van Nes, R., 2002. Multimodal travel choice modelling: a supernetwork aroach. Proceedings of the 81th Annual Meeting of the Transportation Research Board, Washington, D.C.
23. Bierlaire, M., Frejinger, E., 2005. Route choice models with subpath components. Proceedings of the 5th Swiss Transport Research Conference, Ascona, Switzerland.
24. Bierlaire, M., Frejinger, E., 2008. Route choice modeling with network-free data. Transportation Research Part C, 16(2), 187-198. (Pubitemid 351194171)
25. Bliemer, M.C.J., Bovy, P.H.L., 2008. Impact of route choice set on route choice probabilities. Transportation Research Record, 2076, 10-19.
26. Bliemer, M.C.J., Bovy, P.H.L., Li, H., 2007. Some properties and implications of stochastically generated route choice sets. Proceedings of the 6th Tristan Conference, Phuket, Thailand.
27. Bliemer, M.C.J., Taale, H., 2006. Route generation and dynamic traffic assignment for large networks. Proceedings of the First International Symposium on Dynamic Traffic Assignment, Leeds, UK, 90-99.
28. Bovy, P.H.L., 2009. On modelling route choice sets in transportation networks: a synthesis. Transport Reviews, 29(1), 43-68.
29. Bovy, P.H.L., Bekhor, S., Prato, C.G., 2008. The factor of revised path size: an alternative derivation. Transportation Research Record, 2076, 132-140.
30. Bovy, P.H.L., Bekhor, S., Prato, C.G., 2009. Route sampling correction for stochastic route choice set generation. Proceedings of the 88th Annual Meeting of the Transportation Research Board, Washington, D.C.
31. Bovy, P.H.L., Fiorenzo-Catalano, S., 2007. Stochastic route choice set generation: behavioral and probabilistic foundations. Transportmetrica, 3(3), 173-189.
32. Cantillo, V., Heydecker, B., Ortuzar, J.d.D., 2006. A discrete choice model incorporating thresholds for perception in attribute values. Transportation Research Part B, 40(9), 807-825. (Pubitemid 43890592)
33. Cantillo, V., Ortuzar, J.d.D., 2005. A semi-compensatory discrete choice model with explicit attribute thresholds of perception. Transportation Research Part B, 39(7), 641-657. (Pubitemid 40306747)
34. Cascetta, E., 2001. Transportation Systems Engineering: Theory and Methods. Kluwer Academic Publishers, Dordrecht, The Netherlands.
35. 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: Lesort, J.B. (Ed.), Proceedings of the Thirteenth International Symposium on Transportation and Traffic Theory. Pergamon, Lyon, France, 697-711.
36. Cascetta, E., Papola, A., 2001. Random utility models with implicit availability perception of choice travel for the simulation of travel demand. Transportation Research Part C, 9(4), 249-263. (Pubitemid 32489517)
37. Cascetta, E., Russo, F., Vitetta, A., 1997. Stochastic user equilibrium assignment with explicit path enumeration: comparison of models and algorithms. In: Papageorgiou, M., Pouliezos, A. (Eds.), Proceedings of 8th International Symposium on Transportation Systems. Elsevier, Oxford, U. K, 1031-1037.
38. Caussade, S., Ortuzar, J.d.D., Rizzi, L.I., Hensher, D.A., 2005. Assessing the influence of design dimensions on stated choice experiment estimates. Transportation Research Part B, 39(7), 621-640. (Pubitemid 40306746)
39. Chu, C., 1989. A paired combinatorial logit model for travel demand analysis. Proceedings of the 5th World Conference on Transportation Research, Ventura, USA, 295-309.
40. Daganzo, C.F., Sheffi, Y., 1977. On stochastic models of traffic assignment. Transportation Science, 11, 253-274. (Pubitemid 8564093)
41. De la Barra, T., Perez, B., Anez, J., 1993. Multidimensional path search and assignment. Proceedings of the 21st PTRC Summer Annual Meeting, Manchester, England, 307-319.
42. Dial, R.B., 1971. A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Research, 5(2), 83-111.
43. Dial, R.B., 1997. Bicriterion traffic assignment: efficient algorithms plus examples. Transportation Research Part B, 31(5), 357-379. (Pubitemid 127428517)
44. Dial, R.B., 2006. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Research Part B, 40(10), 917-936. (Pubitemid 44028709)
45. Dijkstra, E.W., 1959. A note on two problems in connection with graphs. Numerical Mathematics, 1, 269-271.
46. Dreyfus, S.E., 1969. An appraisal of some shortest path algorithms. Operational Research 17, 395-412.
47. Dougherty, M., 1995. A review of neural networks applied to transport. Transportation Research Part C, 3(4), 247-260. (Pubitemid 26433165)
48. Eppstein, D., 1998. Finding the K shortest paths. Journal of the Society for Industrial and Applied Mathematics, 28(2), 652-673.
49. Fiorenzo-Catalano, S., Van der Zij, 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, 1-11.
50. Fisk, C., 1980. Some developments in equilibrium traffic assignment. Transportation Research Part B 14 (3), 243-255. (Pubitemid 11439210)
51. Frejinger, E., 2007. Random sampling of alternatives in a route choice context. Proceedings of the European Transport Conference, Leeuwenhorst, The Netherlands.
52. Frejinger, E., Bierlaire, M., 2007. Capturing correlation with subnetworks in route choice models. Transportation Research Part B, 41(3), 363-378. (Pubitemid 44858116)
53. Frejinger, E., Bierlaire, M., Ben-Akiva, M.E., 2009. Sampling of alternatives for route choice modeling. Transportation Research Part B, doi:10.1016/j.trb.2009.03.001 (in press).
54. Freundschuh, S.M., 1992. Is there a relationship between spatial cognition and environmental patterns? Lecture Notes in Computer Science, 639, 288-304.
55. Friedrich, M., Hofsäb, I., Wekeck, S., 2001. Timetable-based transit assignment using branch & bound. Transportation Research Record, 1752, 100-107. (Pubitemid 34181180)
56. Gale, N., Golledge, R.G., Pellegrino, J.W., Doherty, S., 1990. The acquisition and integration of route knowledge in an unfamiliar neighbourhood. Journal of Environmental Psychology, 10, 3-25.
57. Garling, T., Golledge, R.G., 2000. Cognitive mapping and spatial decision making. In Kitchin, R., Freundschuh, S.M. (Eds.), Cognitive Mapping: Past, Present, and Future. Routledge, London, 44-65.
58. Gliebe, J.P., Koelman, F., Ziliaskopoulos, A., 1999. Route choice using a paired combinatorial logit model. Proceedings of the 78th Annual Meeting of the Transportation Research Board, Washington, D.C.
59. Hadjiconstantinou, E., Christofides, N., 1999. An efficient implementation of an algorithm for finding k-shortest simple paths. Networks, 34, 88-101. (Pubitemid 129321129)
60. Han, B., Algers, S., Engelson, L., 2001. Accommodating drivers' taste variation and repeated choice correlation in route choice modeling by using the mixed logit model. Proceedings of the 80th Annual Meeting of the Transportation Research Board, Washington, D.C.
61. Henn, V., 2000. Fuzzy route choice model for traffic assignment. Fuzzy Sets and Systems, 116(11), 77-101.
62. Hess, S., Bierlaire, M., Polak, J., 2005. Estimation of value of travel-time savings using mixed logit models. Transportation Research Part A, 39(2-3), 221-236. (Pubitemid 40198645)
63. Hess, S., Polak, J., Bierlaire, M., 2006. Confounding between taste heterogeneity and error structure in discrete choice models. Proceedings of the European Transport Conference, Strasbourg, France.
64. Hoffman, W., Pavley, R., 1959. A method for the solution of the n-th best path problem. Journal of the Association for Computing Machinery, 6, 506-514.
65. Hoogendoorn-Lanser, S., 2005. Modelling travel behaviour in multi-modal networks. Ph.D. Thesis, TRAIL Research School, Technical University of Delft, The Netherlands.
66. Hoogendoorn-Lanser, S., Van Nes, R., Bovy, P.H.L., 2005. Path size and overlap in multi-modal transport networks: a new interpretation. In: Mahmassani H.S. (Ed.), Transportation and Traffic Theory, Flow dynamics and Human Interaction. Elsevier, Oxford, UK, 63-84.
67. Horowitz, J.L., Louviere, J.J., 1995. What is the role of consideration sets in choice modeling? International Journal of Research in Marketing, 12, 39-54.
68. Hunt, D.T., Kornhauser, A.L., 1997. Assigning traffic over essentially-least-cost paths. Transportation Research Record, 1556, 1-7. (Pubitemid 127562331)
69. Jan, O., Horowitz, A., Peng, Z., 2000. Using GPS data to understand variations in path choice. Transportation Research Record 1706, 145-151.
70. Jou, R.C., 2001. Modeling the impact of pre-trip information on commuter departure time and route choice. Transportation Research Part B, 35(10), 887-902.
71. Katoh, N., Ibaraki, T., Mine, H., 1982. An efficient algorithm for k shortest simple paths. Networks, 12, 411-427. (Pubitemid 13488127)
72. Koelman, F., Wen, C., 1998. Alternative nested logit models: structure, properties and estimation. Transportation Research Part B, 32(5), 289-298. (Pubitemid 28437642)
73. Kuby, M., Zhongyi, X., Xiaodong, X., 1997. A minimax method for finding the k-best differentiated paths. Geographical Analysis, 29(4), 298-313.
74. Lam, T.C., Small, K., 2001. The value of time and reliability: measurement from a value pricing experiment. Transportation Research Part E, 37(2-3), 231-251. (Pubitemid 32337880)
75. Lawler, E.L., 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York.
76. Li, H., Guensler, R., Ogle, J., 2005. Analysis of morning commute route choice patterns using Global Positioning System-based vehicle activity data. Transportation Research Record, 1926, 162-170.
77. Lombard, K., Church, R.L., 1993. The gateway shortest path problem: generating alternative routes for a corridor location problem. Geographical Systems, 1, 25-45.
78. Lotan, T., 1997. Effects of familiarity on route choice behavior in the presence of information. Transportation Research Part C, 5(3), 225-243.
79. Lotan, T., Koutsopoulos, H., 1993. Models for route choice behavior in the presence of information using concepts from fuzzy set theory and approximate reasoning. Transportation, 20(2), 129-155.
80. Maher, M., 1998. Algorithms for logit-based stochastic user equilibrium assignment. Transportation Research Part B, 32(8), 539-549. (Pubitemid 29070488)
81. Manski, C., 1977. The structure of random utility models. Theory and Decision, 8 (3), 229-254.
82. McFadden, D., Train, T., 2000. Mixed MNL models for discrete response. Journal of Applied Econometrics, 15(5), 447-470.
83. Murakami, E., Wagner, D., 1999. Can global positioning system (GPS) improve trip reporting? Transportation Research Part C, 7(2-3), 149-165. (Pubitemid 29524565)
84. Nakayama, S., Kitamura, R., 2000. Route choice model with inductive learning. Transportation Research Record, 1725, 63-70. (Pubitemid 32790986)
85. Nakayama, S., Kitamura, R., Fujii, S., 2001. Drivers' route choice rules and network behavior: do drivers become rational and homogeneous through learning? Transportation Research Record 1752, 62-68. (Pubitemid 34181175)
86. Nielsen, O.A., 2000. A stochastic transit assignment model considering differences in passengers utility functions. Transportation Research Part B, 34(5), 377-402. (Pubitemid 30334495)
87. Nielsen, O.A., 2004. Behavioural responses to pricing schemes: description of the Danish AKTA experiment. Journal of Intelligent Transportation Systems, 8(4), 233-251. (Pubitemid 44112501)
88. Nielsen, O.A., Daly, A., Frederiksen, R.D., 2002. A stochastic multi-class road assignment model with distributed time and cost coefficients. Networks and Spatial Economics, 2, 327-346.
89. Nielsen, O.A., Frederiksen, R.D., 2006. Optimisation of timetable-based, stochastic transit assignment models based on MSA. Annals of Operations Research, 144(1), 263-285. (Pubitemid 44304296)
90. Park, D., Rilett, L.R., 1997. Identifying multiple and reasonable paths in transportation networks: a heuristic approach. Transportation Research Record 1607, 31-37. (Pubitemid 127550696)
91. Prashker, J.N., Bekhor, S., 1998. Investigation of stochastic network loading procedures. Transportation Research Record, 1645, 94-102. (Pubitemid 128550899)
92. Prashker, J.N., Bekhor, S., 2000. Congestion, stochastic, and similarity effects in stochastic user equilibrium models. Transportation Research Record, 1733, 80-87. (Pubitemid 32791120)
93. Prashker, J.N., Bekhor, S., 2004. Route choice models used in the stochastic user equilibrium problem: a review. Transport Reviews, 24(4), 437-463. (Pubitemid 39000749)
94. Prato, C.G., 2005. Latent factors and route choice behaviour. Ph.D. Thesis, Turin Polytechnic, Italy.
95. Prato, C.G., Bekhor, S., 2006. Applying branch & bound technique to route choice set generation. Transportation Research Record, 1985, 19-28. (Pubitemid 46479404)
96. Prato, C.G., Bekhor, S., 2007. Modeling route choice behavior: how relevant is the choice set composition? Transportation Research Record, 2003, 64-73. (Pubitemid 351190576)
97. Ramming, S., 2002. Network knowledge and route choice. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, USA.
98. Richardson, A., 1982. Search models and choice set generation. Transportation Research Part A, 16(5-6), 403-419. (Pubitemid 13491026)
99. Ridwan, M., 2004. Fuzzy preference based traffic assignment problem. Transportation Research Part C, 12(3-4), 209-233. (Pubitemid 39364220)
100. Rilett, L.R., Park, D., 2001. Incorporating uncertainty and multiple objectives in real-time route selection. Journal of Transportation Engineering, 127(6), 531-539. (Pubitemid 33066784)
101. Ruphail, N.M., Ranjithan, S.R., ElDessouki, W., Smith, T., Brill, E.D., 1995. A decision suort system for dynamic pre-trip route planning. Applications of advanced technologies. In: Transportation Engineering: Proceedings of The Fourth International Conference, 325-329.
102. Scott, K., Pabon-Jimenez, G., Bernstein, D., 1997. Finding alternatives to the best path. Proceedings of the 76th Annual Meeting of the Transportation Research Board, Washington, D.C.
103. Sheffi, Y., 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, USA.
104. Sheffi, Y., Powell, W.B., 1982. An algorithm for the equilibrium assignment problem with random link times. Networks, 12, 191-207. (Pubitemid 13491787)
105. Shier, D.R., 1976. Iterative methods for determining the K shortest paths in a network. Networks, 6, 205-229.
106. Shier, D.R., 1979. On algorithms for finding the K-shortest paths in a network. Networks, 9, 195-214. (Pubitemid 10418717)
107. Swait, J., 2001. Choice set generation within the generalized extreme value family of discrete choice models. Transportation Research Part B, 35(7), 643-666. (Pubitemid 32722832)
108. Swait, J., Ben-Akiva, M.E., 1987. Incorporating random constraints in discrete models of choice set generation. Transportation Research Part B, 21(2), 91-102. (Pubitemid 17587819)
109. Train, K., Sonnier, G., 2005. Mixed logit with bounded distributions of correlated partworths. In: Scarpa, R., Alberini, A. (Eds.), Applications of Simulation Methods in Environmental and Resource Economics. Springer, Dordrecht, 117-134.
110. Van der Zij, N.J., Fiorenzo-Catalano, S., 2005. Path enumeration by finding the constrained K-shortest paths. Transportation Research Part B, 39(6), 545-563.
111. Vovsha, P., 1997. The cross-nested logit model: application to mode choice in the Tel Aviv metropolitan area. Transportation Research Record, 1607, 13-20.
112. Vrtic, M., Schussler, N., Erath, A., Axhausen, K., Frejinger, E., Bierlaire, M., Stojanovic, S., Rudel, R., Maggi, R., 2006. Including travelling costs in the modelling of mobility behaviour. Final report for SVI research program Mobility Pricing: Project B1, on behalf of the Swiss Federal Department of the Environment, Transport, Energy and Communications, IVT ETH Zurich, ROSO EPF Lausanne and USI Lugano.
113. Wen, C., Koelman, F., 2001. The generalized nested logit model. Transportation Research Part B, 35(7), 627-641. (Pubitemid 32722831)
114. Wolf, J., Schönfelder, S., Samaga, U., Oliveira, M., Axhausen, K.W., 2004. Eighty weeks of Global Positioning System traces: approaches to enriching trip information. Transportation Research Record,1870, 46-54. (Pubitemid 40025780)
115. Yai, T., Iwakura, S., Morichi, S., 1997. Multinomial probit with structured covariance for route choice behavior. Transportation Research Part B, 31(3), 195-207.
116. Yamamoto, T., Kitamura, R., Fujii, J., 2002. Drivers' route choice behavior: analysis by data mining algorithms. Transportation Research Record, 1807, 59-66.
117. Yang, H., Kitamura, R., Jovanis, P.P., Vaughn, K.M., Abdel-Aty, M. A., 1993. Exploration of route choice behavior with advanced traveler information using neural network concepts. Transportation, 20(2), 199-223.
118. Yen, J.Y., 1971. Finding the K shortest loopless paths in a network. Management Science, 17, 712-716.
119. Zhou, Z., Chen, A., 2003. Stochastic user equilibrium problem: a comparison between length-based and congestion-based C-Logit models. In: Loo, B.P.Y., Lam, S.W.K. (Eds.), Proceedings of the 8th Hong Kong Society of Transportation Studies Conference: Transportation and Logistics. Hong Kong, China, 244-253.