A link based network route choice model with unrestricted choice set
Mogens Fosgerau,
Emma Frejinger and
Anders Karlstrom
MPRA Paper from University Library of Munich, Germany
Abstract:
This paper considers the path choice problem, formulating and discussing an econometric random utility model for the choice of path in a network with no restriction on the choice set. Starting from a dynamic specification of link choices we show that it is equivalent to a static model of the multinomial logit form but with infinitely many alternatives. The model can be consistently estimated and used for prediction in a computationally efficient way. Similarly to the path size logit model, we propose an attribute called link size that corrects utilities of overlapping paths but that is link additive. The model is applied to data recording path choices in a network with more than 3,000 nodes and 7,000 links.
Keywords: discrete choice; recursive logit; networks; route choice; infinite choice set (search for similar items in EconPapers)
JEL-codes: C25 C5 (search for similar items in EconPapers)
Date: 2013-07
New Economics Papers: this item is included in nep-dcm, nep-ecm, nep-net, nep-tre, nep-upt and nep-ure
References: Add references at CitEc
Citations: View citations in EconPapers (75)
Downloads: (external link)
https://mpra.ub.uni-muenchen.de/48707/1/MPRA_paper_48707.pdf original version (application/pdf)
Related works:
Journal Article: A link based network route choice model with unrestricted choice set (2013)
Working Paper: A link based network route choice model with unrestricted choice set (2013)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:48707
Access Statistics for this paper
More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter (winter@lmu.de).