Change search
ReferencesLink to record
Permanent link

Direct link
Routing policy choice set generation in stochastic time-dependent networks: Case studies for Stockholm and Singapore
KTH, School of Architecture and the Built Environment (ABE), Transport Science, Traffic and Logistics. KTH, School of Architecture and the Built Environment (ABE), Transport Science, Transport and Location Analysis. KTH, School of Architecture and the Built Environment (ABE), Centres, Centre for Transport Studies, CTS.ORCID iD: 0000-0002-4106-3126
KTH, School of Architecture and the Built Environment (ABE), Transport Science, Traffic and Logistics.ORCID iD: 0000-0001-8750-8242
Show others and affiliations
2014 (English)Conference paper (Refereed)
Abstract [en]

Transportation systems are inherently uncertain due to the occurrence of random disruptions; meanwhile, real-time traveler information offers the potential to help travelers make better route choices under such disruptions. This paper presents the first revealed preference (RP) study of routing policy choice where travelers opt for routing policies instead of fixed paths. 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. An efficient algorithm to find the optimal routing policy (ORP) in large-scale networks is presented, as the algorithm is a building block of any routing policy choice set generation method. Two case studies are conducted in Stockholm, Sweden and Singapore, respectively. Data for the underlying stochastic time-dependent network are generated from taxi Global Positioning System (GPS) traces through the methods of map-matching and non-parametric link travel time estimation. The routing policy choice sets are then generated by link elimination and simulation, in which the ORP algorithm is repetitively executed. The generated choice sets are first evaluated based on whether or not they include the observed GPS traces on a specific day, which is defined as coverage. They are then evaluated on the basis of adaptiveness, defined as the capability of a routing policy to be realized as different paths over different days. It is shown that using a combination of link elimination and simulation methods yield satisfactory coverage. The comparison to a path choice set benchmark suggests that a routing policy choice set could potentially provide better coverage and capture the adaptive nature of route choice. The routing policy choice set generation enables the development of a discrete choice model of routing policy choice, which will be explored in the second stage of the study.

Place, publisher, year, edition, pages
National Category
Transport Systems and Logistics
URN: urn:nbn:se:kth:diva-138256OAI: diva2:680657
Transportation Research Board 93rd Annual Meeting; Washington, D.C., USA, 12-16 January, 2014

TSC import 2407 2013-12-17

QC 20140226

Available from: 2013-12-18 Created: 2013-12-18 Last updated: 2014-02-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Fulltext at KTH web

Search in DiVA

By author/editor
Jenelius, ErikRahmani, Mahmood
By organisation
Traffic and LogisticsTransport and Location AnalysisCentre for Transport Studies, CTS
Transport Systems and Logistics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 43 hits
ReferencesLink to record
Permanent link

Direct link