Skip to main content
Top
Published in: Transportation 1/2020

06-01-2018

Operational route choice methodologies for practical applications

Authors: Evanthia Kazagli, Michel Bierlaire, Matthieu de Lapparent

Published in: Transportation | Issue 1/2020

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper focuses on the application of tractable route choice models and presents a set of methods for deriving relevant disaggregate and aggregate route choice indicators, namely link and route flows. Tractability is achieved at the disaggregate level by the recursive logit model and at the aggregate level by the mental representation item (\(\mathrm {MRI}\)) approach. These two approaches are analyzed here, and extensions of the \({\mathrm {MRI}}\) approach are presented. The analysis elaborates on the features of each model and allows to draw insights into the use of a specific model, depending on the needs of the application and the data availability. The performance of the two models is tested on real data. The results demonstrate the validity of the \({\mathrm {MRI}}\) model that is intended for aggregate analysis.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Footnotes
1
The simplest case concerns a deterministic association of each observation with a \({\mathrm {MRI}}\) sequence. That is, \({\text{P}}({\text{y}} \, | \, {\text{r}}) = 1\) if the y traverses the geographical span of all its elements in the correct order, and zero otherwise. An illustrative example involving one \({\mathrm {MRI}}\) in the sequence is presented in Fig. 12.
 
2
The assumption of \(\mathcal {U}\) is not necessary, but important as discussed in “Introduction” section. Hence, we adopt it throughout the paper, when dealing with the choice set of a disaggregate model.
 
3
In this example, \(\mathcal {M} = {\mathcal {C}}_n\), as there are only two mutually exclusive \(\mathrm {MRIs}\) and no possibility to follow a sequence of them.
 
4
Under the assumption that most observations do not contain loops, the disaggregate model should assign very low probabilities to paths with loops.
 
5
The same dataset is used for the application of the RL model and its extension in Fosgerau et al. (2013), Mai et al. (2015) and Mai (2016).
 
6
The \({\mathrm {MRI}}\)-based models presented in this section are estimated using Biogeme (Bierlaire 2003).
 
7
In this paper we consider observations with a minimum length of 2 km, hence we have a smaller data sample.
 
8
The variables associated with the travel time and length are highly correlated due to the fact that the former is computed based on the latter. Therefore, only one of them is included in the specification.
 
9
500000 paths are sampled for each \({ od }\) pair, by simulating a random walk on the network to draw from the RL link transition probabilities.
 
10
The log likelihood converges to the unconditional value as long as \(t \rightarrow \infty\). 100 samples are used so that the analysis can be conducted in a reasonable computational time.
 
11
The null model predicts equal probabilities for all alternatives, as all its parameters are fixed to zero.
 
Literature
go back to reference Akamatsu, T.: Cyclic flows, markov process and stochastic traffic assignment. Transp. Res. Part B Methodol. 30(5), 369–386 (1996)CrossRef Akamatsu, T.: Cyclic flows, markov process and stochastic traffic assignment. Transp. Res. Part B Methodol. 30(5), 369–386 (1996)CrossRef
go back to reference Azevedo, J., Santos Costa, M., Silvestre Madeira, J., Vieira Martins, E.: An algorithm for the ranking of shortest paths. Eur. J. Oper. Res. 69(1), 97–106 (1993)CrossRef Azevedo, J., Santos Costa, M., Silvestre Madeira, J., Vieira Martins, E.: An algorithm for the ranking of shortest paths. Eur. J. Oper. Res. 69(1), 97–106 (1993)CrossRef
go back to reference Baillon, J.-B., Cominetti, R.: Markovian traffic equilibrium. Math. Program. 111(1–2), 33–56 (2008) Baillon, J.-B., Cominetti, R.: Markovian traffic equilibrium. Math. Program. 111(1–2), 33–56 (2008)
go back to reference Bekhor, S., Ben-Akiva, M.E., Ramming, S.M.: Evaluation of choice set generation algorithms for route choice models. Ann. Oper. Res. 144(1), 235–247 (2006)CrossRef Bekhor, S., Ben-Akiva, M.E., Ramming, S.M.: Evaluation of choice set generation algorithms for route choice models. Ann. Oper. Res. 144(1), 235–247 (2006)CrossRef
go back to reference Bellman, R.: Dynamic Programming, 1st edn. Princeton University Press, Princeton, NJ (1957) Bellman, R.: Dynamic Programming, 1st edn. Princeton University Press, Princeton, NJ (1957)
go back to reference Ben-Akiva, M., Bergman, M.J., Daly, A., Ramaswamy, V.: Modeling interurban route choice behavior. In: Proceedings of the 9th International Symposium on Transportation and Traffic Theory, Utrecht, The Netherlands, pp. 299–330 (1984) Ben-Akiva, M., Bergman, M.J., Daly, A., Ramaswamy, V.: Modeling interurban route choice behavior. In: Proceedings of the 9th International Symposium on Transportation and Traffic Theory, Utrecht, The Netherlands, pp. 299–330 (1984)
go back to reference Bierlaire, M.: BIOGEME: A free package for the estimation of discrete choice models. In: 3rd Swiss Transportation Research Conference, Ascona, Switzerland (2003) Bierlaire, M.: BIOGEME: A free package for the estimation of discrete choice models. In: 3rd Swiss Transportation Research Conference, Ascona, Switzerland (2003)
go back to reference de la Barra, T., Perez, B. Anez, J.: Multidimensional path search and assignment. In: Proceedings of the 21st PTRC Summer Annual Meeting, Manchester, England (1993) de la Barra, T., Perez, B. Anez, J.: Multidimensional path search and assignment. In: Proceedings of the 21st PTRC Summer Annual Meeting, Manchester, England (1993)
go back to reference Flötteröd, G., Bierlaire, M.: Metropolis-Hastings sampling of paths. Transp. Res. Part B Methodol. 48, 53–66 (2013)CrossRef Flötteröd, G., Bierlaire, M.: Metropolis-Hastings sampling of paths. Transp. Res. Part B Methodol. 48, 53–66 (2013)CrossRef
go back to reference Fosgerau, M., Frejinger, E., Karlstrom, A.: A link based network route choice model with unrestricted choice set. Transp. Res. Part B Methodol. 56, 70–80 (2013)CrossRef Fosgerau, M., Frejinger, E., Karlstrom, A.: A link based network route choice model with unrestricted choice set. Transp. Res. Part B Methodol. 56, 70–80 (2013)CrossRef
go back to reference Frejinger, E., Bierlaire, M., Ben-Akiva, M.: Sampling of alternatives for route choice modeling. Transp. Res. Part B Methodol. 43(10), 984–994 (2009)CrossRef Frejinger, E., Bierlaire, M., Ben-Akiva, M.: Sampling of alternatives for route choice modeling. Transp. Res. Part B Methodol. 43(10), 984–994 (2009)CrossRef
go back to reference Friedrich, M., Hofsaess, I., Wekeck, S.: Timetable-based transit assignment using branch and bound techniques. Transp. Res. Rec. J. Transp. Res. Board 1752, 100–107 (2001)CrossRef Friedrich, M., Hofsaess, I., Wekeck, S.: Timetable-based transit assignment using branch and bound techniques. Transp. Res. Rec. J. Transp. Res. Board 1752, 100–107 (2001)CrossRef
go back to reference Hoogendoorn-Lanser, S.: Modelling Travel Behavior in Multi-modal Networks, PhD thesis, Technology University of Delft (2005) Hoogendoorn-Lanser, S.: Modelling Travel Behavior in Multi-modal Networks, PhD thesis, Technology University of Delft (2005)
go back to reference Kazagli, E., Bierlaire, M., Flötteröd, G.: Revisiting the route choice problem: a modeling framework based on mental representations. J. Choice Model. 19, 1–23 (2016)CrossRef Kazagli, E., Bierlaire, M., Flötteröd, G.: Revisiting the route choice problem: a modeling framework based on mental representations. J. Choice Model. 19, 1–23 (2016)CrossRef
go back to reference Lai, X., Bierlaire, M.: Specification of the cross-nested logit model with sampling of alternatives for route choice models. Transp. Res. Part B Methodol. 80, 220–234 (2015)CrossRef Lai, X., Bierlaire, M.: Specification of the cross-nested logit model with sampling of alternatives for route choice models. Transp. Res. Part B Methodol. 80, 220–234 (2015)CrossRef
go back to reference Mai, T.: A method of integrating correlation structures for a generalized recursive route choice model. Transp. Res. Part B Methodol. 93, 146–161 (2016)CrossRef Mai, T.: A method of integrating correlation structures for a generalized recursive route choice model. Transp. Res. Part B Methodol. 93, 146–161 (2016)CrossRef
go back to reference Mai, T., Bastin, F., Frejinger, E.: A decomposition method for estimating complex recursive logit based route choice models. EURO J. Transp. Logist. 1–23 (2016) Mai, T., Bastin, F., Frejinger, E.: A decomposition method for estimating complex recursive logit based route choice models. EURO J. Transp. Logist. 1–23 (2016)
go back to reference Mai, T., Fosgerau, M., Frejinger, E.: A nested recursive logit model for route choice analysis. Transp. Res. Part B Methodol. 75, 100–112 (2015)CrossRef Mai, T., Fosgerau, M., Frejinger, E.: A nested recursive logit model for route choice analysis. Transp. Res. Part B Methodol. 75, 100–112 (2015)CrossRef
go back to reference Prato, C.G., Bekhor, S.: Applying branch and bound technique to route choice set generation. Transp. Res. Rec. 1985, 19–28 (2006)CrossRef Prato, C.G., Bekhor, S.: Applying branch and bound technique to route choice set generation. Transp. Res. Rec. 1985, 19–28 (2006)CrossRef
go back to reference van der Zijpp, N.J., Fiorenzo Catalano, S.: Path enumeration by finding the constrained K-shortest paths. Transp. Res. Part B Methodol. 39(6), 545–563 (2005)CrossRef van der Zijpp, N.J., Fiorenzo Catalano, S.: Path enumeration by finding the constrained K-shortest paths. Transp. Res. Part B Methodol. 39(6), 545–563 (2005)CrossRef
Metadata
Title
Operational route choice methodologies for practical applications
Authors
Evanthia Kazagli
Michel Bierlaire
Matthieu de Lapparent
Publication date
06-01-2018
Publisher
Springer US
Published in
Transportation / Issue 1/2020
Print ISSN: 0049-4488
Electronic ISSN: 1572-9435
DOI
https://doi.org/10.1007/s11116-017-9849-0

Other articles of this Issue 1/2020

Transportation 1/2020 Go to the issue

Premium Partner