Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Routing policy choice set generation in stochastic time-dependent networks: Case studies for Stockholm and Singapore
KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap, Trafik och logistik. KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap, Transport- och lokaliseringsanalys. KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Centra, Centrum för transportstudier, CTS.ORCID-id: 0000-0002-4106-3126
KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap, Trafik och logistik.ORCID-id: 0000-0001-8750-8242
Visa övriga samt affilieringar
2014 (Engelska)Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
2014.
Nationell ämneskategori
Transportteknik och logistik
Identifikatorer
URN: urn:nbn:se:kth:diva-138256OAI: oai:DiVA.org:kth-138256DiVA, id: diva2:680657
Konferens
Transportation Research Board 93rd Annual Meeting; Washington, D.C., USA, 12-16 January, 2014
Anmärkning

TSC import 2407 2013-12-17

QC 20140226

Tillgänglig från: 2013-12-18 Skapad: 2013-12-18 Senast uppdaterad: 2014-02-26Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Fulltext at KTH web

Personposter BETA

Jenelius, ErikRahmani, Mahmood

Sök vidare i DiVA

Av författaren/redaktören
Jenelius, ErikRahmani, Mahmood
Av organisationen
Trafik och logistikTransport- och lokaliseringsanalysCentrum för transportstudier, CTS
Transportteknik och logistik

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 59 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf