WFRF:(Jenelius Erik 1980 )
Sökning: WFRF:(Jenelius Erik 1980 ) > A latent-class adap...
- 48 av 171
- Föregående post
- Nästa post
- Till träfflistan
A latent-class adaptive routing choice model in stochastic time-dependent networks
- Ding-Mastera, Jing (författare)
- Gao, Song (författare)
-
- Jenelius, Erik, Docent, 1980- (författare)
- KTH,Centrum för transportstudier, CTS
- visa fler...
- Ben-Akiva, Moshe (författare)
- visa färre...
- (creator_code:org_t)
- Elsevier, 2019
- 2019
- Engelska.
- Ingår i: Transportation Research Part B. - : Elsevier. - 0191-2615 .- 1879-2367. ; 124, s. 1-17
- Tidskriftsartikel (refereegranskat)
Abstract
Ämnesord
Stäng
- Transportation networks are inherently uncertain due to random disruptions; meanwhile, real-time information potentially helps travelers adapt to realized traffic conditions and make better route choices under such disruptions. Modeling adaptive route choice behavior is essential in evaluating real-time traveler information systems and related policies. This research contributes to the state of the art by developing a latent-class routing policy choice model in a stochastic time-dependent network with revealed preference data. A routing policy is defined as a decision rule applied at each link that maps possible realized traffic conditions to decisions on the link to take next. It represents a traveler's ability to look ahead in order to incorporate real-time information not yet available at the time of decision. A case study is conducted in Stockholm, Sweden and data for the stochastic time-dependent network are generated from hired taxi Global Positioning System (GPS) readings. A latent-class Policy Size Logit model is specified, with routing policy users who follow routing policies and path users who follow fixed paths. Two additional layers of latency in the measurement equation are accounted for: 1) the choice of a routing policy is latent and only its realized path on a given day can be observed; and 2) when GPS readings have relatively long gaps, the realized path cannot be uniquely identified, and the likelihood of observing vehicle traces with non-consecutive links is instead maximized. Routing policy choice set generation is based on the generalization of path choice set generation methods. The generated choice sets achieve 95% coverage for 100% overlap threshold after correcting GPS mistakes and breaking up trips with intermediate stops, and further achieve 100% coverage for 90% overlap threshold. Estimation results show that the routing policy user class probability increases with trip length, and the latent-class routing policy choice model fits the data better than a single-class path choice or routing policy choice model. This suggests that travelers are heterogeneous in terms of their ability and/or willingness to plan ahead and utilize real-time information, and an appropriate route choice model for uncertain networks should take into account the underlying stochastic travel times and structured traveler heterogeneity in terms of real-time information utilization.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Samhällsbyggnadsteknik -- Transportteknik och logistik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Civil Engineering -- Transport Systems and Logistics (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
- Transportation Research Part B (Sök värdpublikationen i LIBRIS)
Till lärosätets databas
- 48 av 171
- Föregående post
- Nästa post
- Till träfflistan
Hitta mer i SwePub
- Av författaren/redakt...
- Ding-Mastera, Ji ...
- Gao, Song
- Jenelius, Erik, ...
- Rahmani, Mahmood ...
- Ben-Akiva, Moshe
- Om ämnet
-
- TEKNIK OCH TEKNOLOGIER
- TEKNIK OCH TEKNO ...
- och Samhällsbyggnads ...
- och Transportteknik ...
- Artiklar i publikationen
- Transportation R ...
- Av lärosätet
- Kungliga Tekniska Högskolan
Sök utanför SwePub
- Sök vidare i:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - Nationella bibliotekssystem
- LIBRIS.kb.se
