Traffic Waiting Time Optimization: An Effective Effort to Overcome Congestion at Gede Ngurah Cakranegara Intersection

Setiawati Setiawati; Dhea Wasila Rahmi; Shofiyurrahman Syauqi; Dara Purnamasari

doi:10.29303/semeton.v1i1.206

Authors

Setiawati Setiawati Universitas Mataram
Dhea Wasila Rahmi Universitas Mataram
Shofiyurrahman Syauqi Universitas Mataram
Dara Purnamasari Universitas Mataram

DOI:

https://doi.org/10.29303/semeton.v1i1.206

Keywords:

compatible graph, gede ngurah cakranegara insection, waiting time optimization

Abstract

Intersections are places that are prone to traffic congestion. This is due to the location and function of the intersection, which if left unchecked will lead to accidents. To overcome this problem, traffic lights are made to regulate traffic flow conditions. Gede Ngurah Cakranegara Intersection is an intersection that has high congestion conditions, this is due to its location in the city center and its function as a main road. In addition, the trigger for congestion at the Gede Ngurah Cakranegara intersection is the waiting time which is still not optimal and the lack of orderly drivers in obeying the traffic lights. Thus, the purpose of this study is to optimize the total waiting time at the Gede Ngurah Cakranegara intersection. Total waiting time optimization is done using compatible graph. The compatible graph in this case will describe the condition of traffic flows that will run simultaneously without interfering with each other, so that they are safe and do not collide with each other. This study uses primary data obtained from field observations conducted in the morning, afternoon and evening. After optimization, the total waiting time at the Gede Ngurah Cakranegara intersection following the light signal is 180 seconds and the total waiting time for those who do not follow the light signal is 120 seconds. Compared to the previous waiting time of 538 seconds, a more optimal time was obtained.

References

R. D. Hardiantil and R. Arifudin, “Penerapan Graf Kompatibel Pada Penentuan Waktu Tunggu Total Optimal Di Persimpangan Jalan Kaligarang Kota Semarang,” Unnes J. Math., vol. 2, no. 1, pp. 1–8, 2013.

E. S. Sendow, M. Sulistyaningsih, and J. F. Monoarfa, “Optimasi Waktu Tunggu Lampu Lalu Lintas dengan Mengaplikasikan Teori Graf dan Metode Webster,” J. Educ., vol. 6, no. 1, pp. 2272–2284, 2023, doi: 10.31004/joe.v6i1.3240.

A. Fanani, “Optimasi Waktu Tunggu Lalu Lintas Dengan Menggunakan Graf Kompatibel Sebagai Upaya Mengurangi Kemacetan,” MathVision J. Mat., vol. 3, no. 1, pp. 1–5, 2021, doi: 10.55719/mv.v3i1.240.

I. Poernamasari, R. Tumilaar, and C. E. J. C. Montolalu, “Optimasi Pengaturan Lampu Lalu Lintas dengan menggunakan Metode Webster (Studi Kasus Persimpangan Jalan Babe Palar),” d’CARTESIAN, vol. 8, no. 1, p. 27, 2019, doi: 10.35799/dc.8.1.2019.24590.

Y. Farida, A. Fanani, I. Purwanti, L. Wulandari, and N. J. Zaen, “Pemodelan Arus Lalu Lintas Dan Waktu Tunggu Total Optimal Di Persimpangan Jl. Jemur Andayani –Ahmad Yani Sebagai Upaya Mengurai Kemacetan,” BAREKENG J. Ilmu Mat. dan Terap., vol. 14, no. 3, pp. 389–398, 2020, doi: 10.30598/barekengvol14iss3pp389-398.

W. D. Utami, A. N. DS, and P. K. Intan, “Optimasi Waktu Tunggu Lampu Lalu Lintas Pada Simpang Lima Krian-Sidoarjo Menggunakan Algoritma Welch-Powell,” MathVisioN, vol. 2, no. 1, pp. 1–6, 2020.

L. M. Ayuk Khoirotun Nisa, “Optimasi Waktu Tunggu Lalu Lintas Dengan Menggunakan Graf Kompatibel Sebagai Upaya Mengurangi Kemacetan,” vol. 03, no. 01, pp. 1–5, 2021.

B. N. Syechah, D. Z. Hairunnisa, M. Fadila, and D. P. Anggraeni, “Model graf kompatibel di persimpangan islamic center (ic) mataram lombok,” Evolusi J. Math. Sci., vol. 7, no. 1, pp. 1–7, 2023.

Monalisa, N. Algusduri, and F. B. Castama, “Penerapan Graf Kompatible Pada Durasi Lampu Lalu Lintas Di Simpang Empat Andalas Kota Padang,” IJESPG J., vol. 1, no. 4, pp. 72–80, 2023.