Compatible Graphs on Traffic Lights Waiting Time Optimization
- 10.2991/aer.k.201221.077How to use a DOI?
- compatible graph, optimal waiting time, traffic light
Congestion at a crossroads caused by improper traffic light waiting times, can create overcrowding in some branches of the road. Therefore, in this article, we will determine the optimal waiting times of traffic lights at a crossroads by using compatible graphs so that the congestion can be reduced. The traffic flows at an intersection can be modeled into a compatible graph. A vertex represents a traffic flow from/to a road connected to the crossroads. Two vertices in a compatible graph are connected by an edge, if and only if the two flows as representations of these two vertices can move simultaneously without causing crossing. By applying various manipulations on a compatible graph model, some systems with simpler traffic flows are obtained, where each system corresponds to a simpler compatible graph. The next process is to determine all spanning subgraph possibilities of the simpler compatible graph, then select spanning subgraphs containing the least number of cliques. By using 60 seconds assumption in a cycle, we obtain the time needed for each traffic flow to move. Waiting times is a product of the time needed for each flow to move and the number of flows contained in the system. By choosing the most effective waiting time of all the systems, the optimal waiting time is obtained. Pasteur crossroads in Bandung is taken as a case in this discussion. Based on secondary data from the Bandung City Department of Transportation, the total average waiting times at this crossroads every hour is about 282 seconds on working days. Meanwhile, according to the compatible graph application, an optimal total waiting time of 135 seconds is obtained.
- © 2020, 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/).
Cite this article
TY - CONF AU - Anie Lusiani AU - Euis Sartika AU - Agus Binarto AU - Endang Habinuddin PY - 2020 DA - 2020/12/22 TI - Compatible Graphs on Traffic Lights Waiting Time Optimization BT - Proceedings of the International Seminar of Science and Applied Technology (ISSAT 2020) PB - Atlantis Press SP - 467 EP - 471 SN - 2352-5401 UR - https://doi.org/10.2991/aer.k.201221.077 DO - 10.2991/aer.k.201221.077 ID - Lusiani2020 ER -