Penentuan Fase dan Waktu Siklus Optimum Simpang Bersinyal dengan Graf Kompatibel dan Webster Modifikasi (Studi Kasus: Persimpangan Sokaraja, Banyumas)
Abstract
Traffic congestion at signalized intersections can be reduced through proper signal timing. This study aims to optimize traffic-signal settings at the Sokaraja intersection, Banyumas Regency, using a directed compatibility graph and a modified Webster method. Primary data collected from October 2025 to Desember 2025 include intersection geometry (approach widths), existing signal timings, and traffic volumes (heavy vehicles, light vehicles, and motorcycles) observed over two weeks during morning, midday, and afternoon periods. Traffic movements were modeled using a directed compatibility graph to identify non-conflicting movements that can run simultaneously; weighting based on approach width and traffic volume was then used to form phases and allocate green splits. The modified Webster calculation yields an optimal cycle length of 149 s for the maximum-demand condition (and 35 s for the minimum-demand condition). Compared with field timings (e.g., red/green 117/70 s on Jl Jendral Soedirman and 137/22 s on Jl Ajibarang–Secang), the recommended timings under maximum demand are 50/86 s and 81/54 s, respectively. Effectiveness evaluation indicates that the red intervals on Jl Jendral Soedirman and Jl Ajibarang–Secang are longer than required, while the other approaches are closer to the optimized settings. These results provide a practical basis for signal retiming and for developing more adaptive control at the Sokaraja intersection.
References
[2] K. Ohno and H. Mine, “Optimal traffic signal settings—II. A refinement of Webster’s method,” Transportation Research, vol. 7, no. 3, pp. 269–292, Sep. 1973, doi: 10.1016/0041-1647(73)90018-X.
[3] A. Verma, G. Nagaraja, C. S. Anusha, and S. K. Mayakuntla, “Traffic Signal Timing Optimization for Heterogeneous Traffic Conditions Using Modified Webster’s Delay Model,” Transportation in Developing Economies 2018 4:2, vol. 4, no. 2, pp. 13-, Aug. 2018, doi: 10.1007/S40890-018-0064-2.
[4] R. F. Sari, H. Cipta, and E. F. Munthe, “Implementasi Algoritma Welch Powell Terhadap Pengaturan Lalu Lintas Persimpangan Jalan Dalam Mengatasi Kemacetan,” Lebesgue: Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika, vol. 3, no. 3, p. 18, Dec. 2022.
[5] Monalisa, N. Agusduri, and F. B. Castama, “Penerapan Graf Kompatible Pada Durasi Lampu Lalu Lintas di Simpang Empat Andalas Kota Padang,” International Journal of Engineering, Economic, Social Politic and Government (IJESPG), vol. 1, no. 4, pp. 1–9, 2023.
[6] O. R. Sikas, G. S. Mada, F. M. A Blegur, A. G. Nabu, and A. History, “Application of graph theory and webster method in traffic light settings at the tulip intersection in kefamenanu city,” Desimal: Jurnal Matematika, vol. 6, no. 3, pp. 323–336, Dec. 2023, doi: 10.24042/djm.
[7] P. Tavakolian, “Optimal Sequencing of Traffic Streams at a Signalized Junction,” Northeastern University, 2011.
[8] A. J. Calle-Laguna, J. Du, and H. A. Rakha, “Computing optimum traffic signal cycle length considering vehicle delay and fuel consumption,” Transp Res Interdiscip Perspect, vol. 3, Dec. 2019, doi: 10.1016/j.trip.2019.100021.
[9] M. Suyudi, M. Mamat, and A. Talib Bon, “Signal Groups of Clique Compatible Graph in Traffic Control Problems,” in Proceedings of the International Conference on Industrial Engineering and Operations Management, Jul. 2018, pp. 1–8.
[10] P. Gora et al., “Solving Traffic Signal Setting Problem Using Machine Learning,” MT-ITS 2019 - 6th International Conference on Models and Technologies for Intelligent Transportation Systems, Jun. 2019, doi: 10.1109/MTITS.2019.8883380.
[11] B. Alonso, S. Del Giudice, G. Musolino, and A. Vitetta, “Traffic Signal Setting at Urban Junctions and Fundamental Diagram: A Before–After Study,” J Adv Transp, vol. 2025, no. 1, p. 3475935, Jan. 2025, doi: 10.1155/ATR/3475935.
[12] S. Direktorat Jenderal Bina Marga, P. Direktur di Direktorat Jenderal Bina Marga, P. Kepala Balai Besar, B. Pelaksanaan Jalan Nasional di Direktorat Jenderal Bina Marga, and P. Kepala Satuan Kerja di Direktorat Jenderal Bina Marga, “Direktorat Jenderal Binamarga,” Jakarta Selatan, 2023.
[13] R. D. Hardianti, R. Rochmad, and R. Arifudin, “Penerapan Graf Kompatibel Pada Penentuan Waktu Tunggu Total Optimal di Persimpangan Jalan Kaligarang Kota Semarang,” Unnes Journal of Mathematics, vol. 2, no. 1, May 2013, doi: 10.15294/UJM.V2I1.1045.
[14] 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: Jurnal Ilmu Matematika dan Terapan, vol. 14, no. 3, pp. 389–398, Oct. 2020, doi: 10.30598/BAREKENGVOL14ISS3PP389-398.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
