Operational macroscopic modeling of complex urban road intersections

Flötteröd, GunnarEcole Polytechnique Fédérale de Lausanne (EPFL), School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory (TRANSP-OR), Lausanne, Switzerland (författare)

TSC import 810 2012-02-06. QC 20120208
This article describes a new approach to the macroscopic first order modeling and simulation of traffic flow in complex urban road intersections. The framework is theoretically sound, operational, and comprises a large body of models presented so far in the literature. Working within the generic node model class of Tampere et al. (2011), the approach is developed in two steps. First, building on the incremental transfer principle of Daganzo et al. (1997), an incremental node model for general road intersections is developed. A limitation of this model (as of the original incremental transfer principle) is that it does not capture situations where the increase of one flow decreases another flow, e.g., due to conflicts. In a second step, the new model is therefore supplemented with the capability to describe such situations. A fixed-point formulation of the enhanced model is given, solution existence and uniqueness are investigated, and two solution algorithms are developed. The feasibility and realism of the new approach is demonstrated through a synthetic and a real case study.

Rohde, Jannis (författare)
Ecole Polytechnique Fédérale de Lausanne (EPFL), School of Architecture, Civil and Environmental Engineering (ENAC), Transport and Mobility Laboratory (TRANSP-OR), Lausanne, Switzerland (creator_code:org_t)

Ingår i:Transportation Research Part B: Elsevier BV45:6, s. 903-9220191-26151879-2367

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Samhällsbyggnads ...; och Transportteknik ...

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.