ALGORITMA GENERATE AND TEST UNTUK OPTIMALISASI MASALAH RUTE PERJALANAN

Authors

  • Khairunnisak Khairunnisak Universitas AMIKOM Purwokerto
  • Dina Fajar Sulistiyani Universitas Amikom Purwokerto
  • Zezya Ramadhany Universitas Amikom Purwokerto

DOI:

https://doi.org/10.31598/sintechjournal.v4i2.719

Keywords:

Generate and Test, Traffic Jam, Optimal Route

Abstract

The common of urban city problem is a traffic jam, and it is heavily affect the public transportation service quality. Many cities in tropical countries suffer of heavy traffic jam due to the populaition of motorbike. According to Central Java Province Government, in 2014 the population of motorcycle is 439.418 units with the ownership ratio at 0.75 unit/person. Solo is one of typical middle size city in Central Java, Indonesia. Solo suffers from traffic jam in particular time of the day and it affect the quality of service of batik solo as the mass transportation service in Surakarta. This research would like to help the community get the optimal travel route with the fastest time, especially at the busiest times. The method used is Generate and Test algorithm. This method is a combination of Depth First Search and Backtracking. This research is conducted to get information about the influence of traffic volume, service road level and traffic jam level toward the time needed for Batik Solo Trans to find the optimal route. There is a route that been selected to be the most optimal route by considering the factors that influence it and the algorithm applied

Downloads

Download data is not yet available.

References

BPS, SURAKARTA DALAM ANGKA 2019. SURAKARTA, 2019.

UP3AD, “Rasio Kepemilikan Kendaraan Bermotor,” 2014. [Online]. Available: http://dppad.jatengprov.go.id/up3ad-kota-surakarta/. [Accessed: 25-Nov-2020].

W. P. Astuti, “KAJIAN SPASIAL TINGKAT KEMACETAN LALULINTAS SEPANJANG RUTE BIS ‘BATIK SOLO TRANS’ MENGGUNAKAN DATA PENGINDERAAN JAUH DAN SISTEM INFORMASI GEOGRAFIS,” Universitas Muhammadiyah Surakarta, 2015.

A. M. Asfar, “Rute Lengkap BST dan Koridornya,” 2014. [Online]. Available: https://www.solopos.com/bst-solo-inilah-rute-lengkap-bst-dan-bus-kota-solo-koridor-1-8-492319. [Accessed: 25-Nov-2020].

R. A. Nugroho, E. B. Santoso, and C. Susetyo, “Analisis Kinerja Batik Solo Trans Menurut Wisatawan Lokal sebagai Pengguna Moda Di Kota Surakarta,” JSHP ( J. Sos. Hum. dan Pendidikan), vol. 2, no. 2, p. 106, 2018.

A. Chandel and M. Sood, “Searching and Optimization Techniques in Artificial Intelligence: A Comparative Study & Complexity Analysis,” Int. J. Adv. Res. Comput. Eng. Technol., vol. 3, no. 3, pp. 866–871, 2014.

D. T. Salaki, “PENENTUAN LINTASAN TERPENDEK DARI FMIPA KE REKTORAT DAN FAKULTAS LAIN DI UNSRAT MANADO MENGGUNAKAN ALGORITMA DJIKSTRA,” J. Ilm. Sains, vol. 11, no. 1, pp. 1–4, 2011.

U. M. Yildirim and B. Catay, “An Enhanced Network-Consistent Travel Speed Generation Scheme on Time-Dependent Shortest Path and Routing Problems,” IEEE Trans. Intell. Transp. Syst., pp. 1–12, 2020.

M. G. Arfananda, S. M. Nasution, and C. Setianingsih, “A Selection of Bandung City Travel Route Using The FLOYD-WARSHALL Algorithm,” Int. J. Integr. Eng., vol. 12, no. 7, pp. 90–97, 2020.

M. S. Yusuf, H. M. Az-zahra, and D. H. Apriyanti, “Implementasi Algoritma Dijkstra Dalam Menemukan Jarak Terdekat Dari Lokasi Pengguna Ke Tanaman Yang Di Tuju Berbasis Android ( Studi Kasus di Kebun Raya Purwodadi ),” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 1, no. 12, pp. 1779–1781, 2017.

W. Alfarisi, “Pencarian Jalur Terpendek Pengirima N Barang Menggunakan Algoritma A* Studi Kasus Kantor POS Besar Medan),” JURIKOM (Jurnal Ris. Komputer), vol. 3, no. 1, pp. 90–95, 2016.

H. Pradibta and Dimas Prayoga, “Rancang Bangun Game Jelangkung Dengan Penentuan Rute Terpendek Menggunakan Metode Heuristic,” Progr. Stud. Tek. Inform. Jur. Teknol. Informasi, Politek. Negeri Malang, vol. 2015, no. 2460–1160, 2015.

M. Abrori and R. N. Setiyani, “Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta),” J. Fourier, vol. 4, no. 2, p. 93, 2015.

G. P. Potdar and R. C. Thool, “Optimal Solution for Shortest Path Problem Using Heuristic Search Technique,” Int. J. Adv. Res. Comput. Eng. Technol., vol. 3, no. 9, pp. 3247–3256, 2014.

A. Selvy Welianto; R. Gunawan Santosa; Rachmat, “IMPLEMENTASI ALGORITMA GENERATE AND TEST PADA PENCARIAN RUTE TERPENDEK,” J. Inform., vol. 7, no. 2, pp. 1–10, 2011.

Admin, “BATIK SOLO TRANS,” 2010. [Online]. Available: https://pariwisatasolo.surakarta.go.id/destinations/batik-solo-trans.

A. Magfirona, N. Hidayati, A. Riyanto, and S. Sunarjono, “Analisis Kinerja Ruas Jalan Di Kawasan Kerten Surakarta,” in Prosiding Konferensi Nasional Ke- 5 Asosiasi Program Pascasarjana Perguruan Tinggi Muhammadiyah(APPPTM), 2019, no. February, pp. 4–9.

D. N. Aprilia, “PELAKSANAAN PERLINDUNGAN BAGI PENGGUNA JASA ANGKUTAN BUS BATIK SOLO TRANS (BST) ATAS HAK KESELAMATAN KONSUMEN MENURUT UNDANG-UNDANG NOMOR 8 TAHUN 1999 TENTANG PERLINDUNGAN KONSUMEN,” Universitas Sebelah Maret, 2017.

A. Rachmawati, A. Nugraha, and M. Awaluddin, “Desain Aplikasi Mobile Informasi Pemetaan Jalur Batik Solo Trans Berbasis Android Menggunakan Location Based Service,” J. Geod. Undip, vol. 6, no. 2, pp. 46–55, 2017.

L. Fu, D. Sun, and L. R. Rilett, “Heuristic shortest path algorithms for transportation applications: State of the art,” in Computers and Operations Research, 2006, vol. 33, no. 11, pp. 3324–3343.

Y. Zeng, X. Chen, X. Cao, S. Qin, M. Cavazza, and Y. Xiang, “Optimal route search with the coverage of users’ preferences,” IJCAI Int. Jt. Conf. Artif. Intell., vol. 2015–Janua, no. Ijcai, pp. 2118–2124, 2015.

Downloads

Published

2021-10-28

How to Cite

[1]
K. Khairunnisak, D. F. . Sulistiyani, and Z. Ramadhany, “ALGORITMA GENERATE AND TEST UNTUK OPTIMALISASI MASALAH RUTE PERJALANAN”, SINTECH Journal, vol. 4, no. 2, pp. 106-114, Oct. 2021.

Issue

Vol. 4 No. 2 (2021): SINTECH Journal Edition Oktober 2021

Section

Articles

License

Copyright (c) 2021 Khairunnisak, Dina Fajar Sulistiyani, Zezya Ramadhany

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Copyright in each article belongs to the author.

  1. The authors admit that SINTECH Journal as a publisher who published the first time under   Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) License.
  2. Authors can include writing separately, regulate distribution of non-ekskulif of manuscripts that have been published in this journal into another version (eg sent to respository institution author, publication into a book, etc.), by recognizing that the manuscripts have been published for the first time in SINTECH Journal