Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
VŠETEČKA, M.; NOVÁK, M.
Originální název
Solution to a capacity problem using non-conventional intersections
Anglický název
Druh
Stať ve sborníku v databázi WoS či Scopus
Originální abstrakt
When designing the road network for the urban tender for new southern part of Brno city center, the authors of this paper came across a problem of heavily loaded intersection, which due to capacity reasons could not be designed as one-level – due to architectural issues and because of a nearby small river it was also not possible to use a multi-level design. Focus was therefore put on designing a non-conventional intersection, which diverts left turns to a neighboring intersection, not to nearby streets. The nearby streets can therefore be designed as purely service roads. In contrast to a one-way design or a design with only right turns permitted, this does not lead to lengthening the routes and is also important for the environment. The traffic at the traffic light-controlled complex of intersections has been tested using a microscopic traffic simulation, which proved the higher capacity of this solution. Sufficient capacity margin is important not just for the vehicles, but also pedestrians, because otherwise there would be a pressure to reduce the number of crossings. Several parameters of the results of the model were compared with conventional one-level and multi-level intersections.
Anglický abstrakt
Klíčová slova
intersection, capacity, non-conventional intersection
Klíčová slova v angličtině
Autoři
Rok RIV
2018
Vydáno
10.04.2017
ISBN
978-1-138-03009-1
Kniha
Transport Infrastructure and Systems
Strany od
843
Strany do
850
Strany počet
8
BibTex
@inproceedings{BUT140152, author="Martin {Všetečka} and Martin {Novák} and Tomáš {Apeltauer}", title="Solution to a capacity problem using non-conventional intersections", booktitle="Transport Infrastructure and Systems", year="2017", pages="843--850", doi="10.1201/9781315281896-109", isbn="978-1-138-03009-1" }