Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Routing Policy Choice Set Generation in Stochastic Time-Dependent Networks Case Studies for Stockholm, Sweden, and Singapore
KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap.ORCID-id: 0000-0002-4106-3126
KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap.ORCID-id: 0000-0001-8750-8242
Vise andre og tillknytning
2014 (engelsk)Inngår i: Transportation Research Record, ISSN 0361-1981, E-ISSN 2169-4052, nr 2466, s. 76-86Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Transportation systems are inherently uncertain because of random disruptions; nevertheless, real-time information can help travelers make better route choices under such disruptions. The first revealed-preference study of routing policy choice is presented. A "routing policy" is defined as a decision rule applied at each link that maps possible realized traffic conditions to decisions to be made on the link next. The policy represents a traveler's ability to incorporate real-time information not yet available at the time of decision. Two case studies are conducted in Stockholm, Sweden, and in Singapore. Data for the underlying stochastic time-dependent network are generated from taxi GPS traces through map-matching and nonparametric link travel time estimation. An efficient algorithm to find the optimal touting policy in large-scale networks is first presented, which is a building block of any routing policy choice set generation method. The routing policy choice sets are then generated by link elimination and simulation. The generated choice sets are first evaluated on the basis of whether they include the observed traces on a specific day, or coverage. The sets 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. A combination of link elimination and simulation methods yields satisfactory coverage. The comparison with a path choice set benchmark also suggests that a routing policy choice set could potentially provide better coverage and capture the adaptive nature of route choice.

sted, utgiver, år, opplag, sider
2014. nr 2466, s. 76-86
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-166530DOI: 10.3141/2466-09ISI: 000352118300010Scopus ID: 2-s2.0-84938559368OAI: oai:DiVA.org:kth-166530DiVA, id: diva2:811467
Merknad

QC 20150512

Tilgjengelig fra: 2015-05-12 Laget: 2015-05-11 Sist oppdatert: 2020-03-10bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Jenelius, ErikRahmani, Mahmood

Søk i DiVA

Av forfatter/redaktør
Jenelius, ErikRahmani, Mahmood
Av organisasjonen
I samme tidsskrift
Transportation Research Record

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 62 treff
RefereraExporteraLink to record
Permanent link

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