F. Marpaung, A. Ritonga
Traffic congestion is a problem faced by various cities in Indonesia. One solution is to use traffic light. The existence of a traffic light lamp is very helpful to discipline road users, but in many cases, it is less optimal, related to determining which currents must be red or green and how long each one is. To overcome this problem, a graph approach is used with point coloring application as a scheduling problem. The purpose of this study was to determine the application of the graph at the intersection using the Recursive Large First Algorithm to optimize traffic light settings in the city of Medan and simulation of traffic light settings using Microsoft Visual Basic 6.0. The research method consisted of several stages, namely collecting data, transforming road intersections and their currents into graph shapes, coloring each node on the graph using the Recursive Large first Algorithm, determining the alternative completion of the green light duration and the flashing red light with a certain time cycle, designing simulations and withdrawals conclusion. From the analysis results obtained the calculation results showed that there is a more optimal level of effectiveness from the total duration of secondary data traffic light settings with primary data at the intersection of Gatot Subroto round about and aksara in Medan city. © 2019 Institute of Physics Publishing. All rights reserved.
Universitas Negeri Medan, Jl. Williem Iskandar Pasar V Medan Estate, Indonesia
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock