PEMODELAN ARUS LALU LINTAS DAN WAKTU TUNGGU TOTAL OPTIMAL DI PERSIMPANGAN JL. JEMUR ANDAYANI AHMAD YANI SEBAGAI UPAYA MENGURAI KEMACETAN
Abstract
One crossroad of ​​Surabaya whose high level of congestion is the crossing of Jemur Andayani – Ahmad Yani Street. It needs to Improve traffic management, geometric, and signal time to obtain optimal traffic performance. The purpose of this study is to make a model of traffic flow and determine the optimal total waiting time at the crossing of Jemur Andayani – Ahmad Yani using Compatible Graph. Compatible graphs are two sets where vertices indicate objects to be arranged and edges indicate compatible pairs of objects. Compatible traffic flow is two traffic flows which if both of them run simultaneously can run safely and not collide. The results of the optimal waiting time calculation using a compatible graph assuming the left turn following the lamp is 75 seconds. While the optimal total waiting time by assuming the left turn not following the lights is 60 seconds. The optimal total waiting time is smaller than the actual total waiting time currently applied at Frontage Ahmad Yani street, which is 170 seconds by assuming turn left following the lights.
Downloads
References
B. P. Statistik, "Perkembangan jumlah kendaraan bermotor menurut jenis," Senin November 2017. [Online]. Available: www.BPS.go.id. [Accessed Senin November 2019].
Atmaja and N. Insani, "Pengoptimalan sistem arus lalu lintas menggunakan pemodelan graf kompatibel (studi kasus persimpangan jembatan baru UGM)," Jurnal Matematika, vol. 05, no. 01, pp. 1-7, 2016.
Aini, "Awal tahun 2018, Dispendukcapil predikat jumlah warga pendatang di surabaya tak ada lonjakan," Selasa November 2018. [Online]. Available: Tribunjatim.com. [Accessed Senin November 2019].
S. Basriati and S. Wahyuni, "Teori graph dan implementasinya dalam ilmu komputer," Sains Matematika dan Statistika, vol. 02, no. 01, pp. 1-7, 2016.
C. Rahmawati and D. Novitasari, "Evaluasi kinerja lalu lintas simpang bersinyal Jl. Ahmad Yani-Jemur Andayani dengan adanya frontage road surabaya," Institut Teknologi Sepuluh Nopember, Surabaya, 2013.
E. Budi and Sunarsih, "Masalah rute terpendek pada jaringan jalan menggunakan lalu lintas," Jurnal Matematika dan Komputer, vol. 06, no. 01, pp. 59-70, 2013.
M. Riana, "Model antrian waktu tunggu kendaraan di persimpangan lampu lalu lintas condong catur dengan compound poisson arrivals dan memperhatikan sisa antrian sebelumnya," Universitas Negeri Yogyakarta, Yogyakarta, 2014.
D. Hardianti, "Penerapan graf kopatibel pada penentuan waktu tunggu total optimal di persimpangan jalan kaligarang kota semarang," UNNES Journal of Mathematics, vol. 02, no. 01, pp. 1-8, 2013.
A. Fanani, "Optimasi waktu tunggu lampu lalu lintas dengan menggunakan graf kompatibel sebagai upaya mengurangi kemacetan," SYSTEMIC, vol. 02, no. 01, pp. 45-50, 2016.
Sutrisno, "Aplikasi graf dalam rekayasa perangkat lunak," MUARA, vol. 01, no. 01, pp. 315-327, 2017.
AASHTO, Apolicy on geometric design of highways and street, Washington DC, 2007.
Wilson and J. Watskin, Graph Introductory Approach, 1976.
S. Tanvee, "Application of graph theory for scheduling of traffic lights," International Journal of Mathematics and Computer Application Research, vol. 03, no. 01, pp. 271-275, 2015.
K. M and Taufiqurrochman, "Pemanfaatan aplikasi graf pada pembuatan jalur angkot 05 Tasikmalaya," Seminar Nasional dan Teknologi, vol. 05, no. 01, pp. 1-6, 2017.
R. Munir, Matematika Diskrit, Bandung: Informatika, 2001.
I. Roza, "Graf garis (line graph) dari graf siklus, graf lengkap dan graf bintang," Matematika UNAND, vol. 03, no. 02, pp. 1-4, 2014.
A. K. Baruah, "Traffic control problem using graph connectivity," International Journal of Computer Application, vol. 86, no. 11, pp. 1-3, 2014.
A. K. Baruah, "Signal groups of compatible graph in traffic control problem," International Journal of Advance Networking and Application, vol. 04, no. 01, pp. 1-3, 2012.
Hosseini and Orooji, "Phasing of traffic light at a road junction," Applied Mathematical Science, vol. 03, no. 30, pp. 1-8, 2009.
R. Johnsonbaugh, Discrete Mathematics revised edition, New York: Maemillian Publishing Company, 1986.
Wirdasari, "Teori graph dan implementasinya dalam ilmu komputer," SAINTIKOM, vol. 10, no. 01, pp. 23-34, 2011.
I. Budayasa, Teori graf dan aplikasinya, Surabaya: UNESA University Press, 2007.
H. Sutarno, Common text book matematika diskrit, Jakarta: Universitas Pendidikan Indonesia, 2003.
A. K. Baruah, "Intersection graph in traffic control problem," International Journal of Mathematics and Computer Application Research, vol. 03, no. 01, pp. 265-270, 2013.
D. Dave and N. Jhala, "Application of graph theory in traffic management," International Journal of Engineering and Inovative Technology, vol. 03, no. 12, pp. 124-126, 2014.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
- Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.
