Implementation of Graph Theory on the Setting of the Traffic Light Intersection
Abstract
On the crossroads of course required setting traffic lights for vehicles that can be flashed with a sense of security and comfort. The duration of the traffic lights can be set to the maximum extent possible so that the vehicle could pass the road regularly. There are many solutions to manage traffic at a crossroads. One of them is a solution which will be given through this observation. This paper aims to describe the related optimization settings traffic by using the algorithm staining which aims to get the chromatic number of graphs. The optimization needs to be done due to the settings of the traffic at the Intersection of Palimanan often seen traffic jams and crowded at rush hour as a result of policies that allow the current to be incompatible. The application of the algorithm staining Welch – Powel to determine the chromatic number of graphs can be another option to resolve the problem. After the current – the current at the traffic being transformed into a graph model that will be coloring a graph and calculating the number lens. Chromatic number of the graph model is 4 so there is a change in the duration of the red and green lights on the traffic. Although there is a reduction in the duration of the red light and the addition of the duration of the green light, the removal of the current incompatibility can minimize the possibility of congestion.
Downloads
References
[2] F. F. Anugra and S. Sardjito, “Penanganan Kemacetan Lalu Lintas Di Koridor Jalan Kramat Gantung, Surabaya,†J. Tek. ITS, vol. 3, no. 1, pp. C28–C31, 2014, [Online]. Available: http://www.ejurnal.its.ac.id/index.php/teknik/article/view/5737%0Ahttp://ejurnal.its.ac.id.
[3] D. Purnamasari, M. Z. Ilman, and D. W. A. P, “Algoritma Welch-Powell untuk Pengendalian Lampu Lalu Lintas,†Ug Jurnal, vol. 6, no. 3. pp. 26–33, 2012.
[4] S. D. Aji, “Penerapan Graf Pada Persimpangan Menggunakan Algoritma Welsh-Powell,†Universitas Negeri Semarang, 2015.
[5] E. K. Setiawan and I. K. Budayasa, “Application of graph theory concept for traffic light control at crossroad,†AIP Conf. Proc., vol. 1867, no. August, 2017, doi: 10.1063/1.4994457.
[6] Faisal, “Teknik Menentukan Perjalanan Pada Masalah Persimpangan dengan Metode Greedy Coloring,†vol. 1, no. 1, pp. 43–46, 2013.
[7] N. As’ad, “Aplikasi Pewarnaan Graf pada Pemecahan Masalah Penyusunan Jadwal,†http://informatika.stei.itb.ac.id/~rinaldi.munir/Matdis/2008-2009/Makalah2008/Makalah0809-038.pdf, vol. 38, pp. 1–6, 2008.
[8] Riwinoto and I. K. Yugo, “Simulasi Optimasi Pengaturan Lampu Lalu Lintas Di Kota Depok,†2010, pp. 92–97.
[9] A. KumarBaruah and N. Baruah, “Clique Matrix of a Graph in Traffic Control Problems,†Int. J. Comput. Appl., vol. 53, no. 6, pp. 41–45, 2012, doi: 10.5120/8427-2194.
[10] G. N. Purnama Jaya, “Analisis Masalah Kemacetan Sekitar Pasar Tegal Gubug Pantura Di Ruas Jalan Indramayu - Cirebon,†Universitas Pakuan, 2013.
[11] Miftahurrahman, “Aplikasi Teori Graf dalam Pengaturan Lampu Lalu Lintas.,†UIN Alauddin Makassar, 2016.
[12] S. T. Shakera Tanveer, “Application of Graph Theory for Scheduling of Traffic Lights,†Int. J. Math. Comput. Appl. Res., vol. 7, no. 5, pp. 21–24, 2017, doi: 10.24247/ijmcaroct20172.
[13] U. Cahyani, “Optimasi Pengaturan Lampu Lalu Lintas Kota Medan Menggunakan Graf dan Metode Webster,†Universitas Sumatera Utara, 2018.
