Capturing correlation with subnetworks in route choice models
When using random utility models for a route choice problem, a critical issue is the significant correlation among alternatives. There are basically two types of models proposed in the literature to address it: (i) a deterministic correction of the path utilities in a Multinomial Logit model (such as the Path Size Logit or the C-Logit models) and (ii) an explicit modeling of the correlation through assumptions about the error terms, and the use of advanced discrete choice models such as the Cross-Nested Logit or the Error Component models. The first is simple, easy to handle and often used in practice. Unfortunately, it does not correctly capture the correlation structure, as we discuss in details in the paper. The second is more consistent with the modeling objectives, but very complicated to specify and estimate. The modeling framework proposed in this paper allows the analyst to control the trade-off between the simplicity of the model and the level of realism. Within this framework, the key concept capturing the correlation structure is called a subnetwork. A subnetwork is a simplification of the road network only containing easy identifiable and behaviorally relevant roads. In practice, the subnetwork can easily be defined based on the route network hierarchy. The importance and the originality of our approach lie in the possibility to capture the most important correlation without considerably increasing the model complexity. This makes it suitable for a wide spectrum of applications, namely involving realistic large-scale networks. As an illustration, we present estimation results of a factor analytic specification of a mixture of Multinomial Logit model, where the correlation among paths is captured by error components. The estimation is based on a GPS dataset collected in the Swedish city of Borlänge. The results show a significant increase in model fit and forecasting performance for the Error Component model compared to a Path Size Logit model. Moreover, the correlation parameters are significant.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 41 (2007)
Issue (Month): 3 (March)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Azevedo, JoseAugusto & Santos Costa, Maria Emilia O. & Silvestre Madeira, Joaquim Joao E. R. & Vieira Martins, Ernesto Q., 1993. "An algorithm for the ranking of shortest paths," European Journal of Operational Research, Elsevier, vol. 69(1), pages 97-106, August.
- Cascetta, Ennio & Russo, Francesco & Viola, Francesco A. & Vitetta, Antonino, 2002. "A model of route perception in urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 577-592, August.
- Yai, Tetsuo & Iwakura, Seiji & Morichi, Shigeru, 1997. "Multinomial probit with structured covariance for route choice behavior," Transportation Research Part B: Methodological, Elsevier, vol. 31(3), pages 195-207, June.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:41:y:2007:i:3:p:363-378. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.