Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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
Stochastic network link transmission model
KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap, Systemanalys och ekonomi.
2017 (engelsk)Inngår i: Transportation Research Part B: Methodological, ISSN 0191-2615, E-ISSN 1879-2367, Vol. 102, s. 180-209Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

This article considers the stochastic modeling of vehicular network flows, including the analytical approximation of joint queue-length distributions. The article presents two main methodological contributions. First, it proposes a tractable network model for finite space capacity Markovian queueing networks. This methodology decomposes a general topology queueing network into a set of overlapping subnetworks and approximates the transient joint queue-length distribution of each subnetwork. The subnetwork overlap allows to approximate stochastic dependencies across multiple subnetworks with a complexity that is linear in the number of subnetworks. Additionally, the network model maintains mutually consistent overlapping subnetwork distributions. Second, a stochastic network link transmission model (SLTM) is formulated that builds on the proposed queueing network decomposition and on the stochastic single-link model of Osorio and Flötteröd (2015). The SLTM represents each direction of a road and each road intersection as one queueing subnetwork. Three experiments are presented. First, the analytical approximations of the queueing-theoretical model are validated against simulation-based estimates. An experiment with intricate traffic dynamics and multi-modal joint distributions is studied. The analytical model captures most dependency structure and approximates well the simulated network dynamics and joint distributions. Even for the considered simple network, which consists of only eight links, the proposed subnetwork decomposition yields significant gains in computational efficiency: It uses less than 0.0025% of the memory that is required by the use of a full network model. Second and third, the proposed SLTM is illustrated with a linear test network adopted from the literature and a more general topology network containing a diverge node and a merge node. Time-dependent probabilistic performance measures (occupancy uncertainty bands, spillback probabilities) are presented and discussed.

sted, utgiver, år, opplag, sider
Elsevier, 2017. Vol. 102, s. 180-209
Emneord [en]
Kinematic-Wave Model, Traffic Flow, Queuing-Systems, Node Models, Blocking, Time, Efficient, Approximation, Congestion, Highway
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-209513DOI: 10.1016/j.trb.2017.04.009ISI: 000405538900010Scopus ID: 2-s2.0-85020029229OAI: oai:DiVA.org:kth-209513DiVA, id: diva2:1112949
Merknad

QC 20170621

Tilgjengelig fra: 2017-06-21 Laget: 2017-06-21 Sist oppdatert: 2017-08-01bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Flötteröd, Gunnar
Av organisasjonen
I samme tidsskrift
Transportation Research Part B: Methodological

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

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

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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