Merge Before Toll Based on the Maximum Traffic Flow

DOI

10.2991/aetr-17.2018.35How to use a DOI?

Keywords

Toll station; the Maximum traffic flow; Merging pattern; Dynamic Programming

Abstract

Highway toll station is one of the most important components and is the only entrance of highway. The traffic capacity of highway is straightforward influenced by the capacity of toll station. So in order to acquire the optimal configuration of merging pattern before toll, this paper construct a model by the Dynamic Programming method. For maximize the throughput, the model designed the different merging pattern. Firstly, the model built the quadratic equation between the throughput and density. Secondly, vehicles are divided into three categories according to their types and speed: the fast vehicles, the medium speed vehicles and the slow vehicles. In accordance with speed, we divided the lines of toll station into the fast lines and the slow lines. The different merging pattern generated by the correspondence of vehicles and lines. Thirdly, we acquired the density when the throughput up to maximum. Finally, according to the density, determined the merging pattern. Meanwhile, in the merging pattern, the throughput up to maximum.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Feifei Han
PY  - 2018/03
DA  - 2018/03
TI  - Merge Before Toll Based on the Maximum Traffic Flow
BT  - Proceedings of the 2017 International Conference Advanced Engineering and Technology Research (AETR 2017)
PB  - Atlantis Press
SP  - 183
EP  - 186
SN  - 2352-5401
UR  - https://doi.org/10.2991/aetr-17.2018.35
DO  - 10.2991/aetr-17.2018.35
ID  - Han2018/03
ER  -