Pencarian Rute Terpendek menggunakan Algoritma Genetika (Studi Kasus : Pengoptimalan Mobilitas Kota Salatiga Terhadap Kota-Kota Tetangga)
Original Full-Text Article
Download published version for reading and archivingAbstract
The increase in population in an area has a significant impact on vehicle density in that area. The problem that often arises is traffic jams that occur on several routes at once. This factor is a common problem, which is quite disturbing to the public and road users. To overcome this problem, the genetic algorithm method is used as a solution method. This case study was set at the regional or city level around Salatiga City, including Ambarawa City, Semarang City, Boyolali City, Solo City and Magelang City. By using the genetic algorithm method, the fastest route with the shortest distance can be found. The Genetic Algorithm used in this research allows optimal shortest route search results. Apart from that, this research can also minimize the distance and travel time of several alternative routes obtained, thus providing significant benefits in developing the transportation system in the region.
Author Biographies
Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Kristen Satya Wacana, Kota Salatiga, Provinsi Jawa Tengah, Indonesia
Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Kristen Satya Wacana, Kota Salatiga, Provinsi Jawa Tengah, Indonesia
How to Cite
This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License .
- Share: You are free to copy, distribute, and transmit the work in any medium or format.
- Adapt: You are free to remix, transform, and build upon the work for any purpose, even commercially.
- Attribution: You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
References
Total: 9 References- Irianti, A., Cokrowibowo, S., & Aswandi, A. (2021). Optimasi Multiple Traveling Salesman Problem dengan Algoritma Genetika pada Kasus Model Rute Terpendek Penjemputan Sampah di Kabupaten Majene. Proceeding KONIK (Konferensi Nasional Ilmu Komputer), 5, 86-89.
- Melladia, M. (2020). Algoritma Genetika Menentukan Jalur Jalan dengan Lintasan Terpendek (Shortest Path). Prosiding SISFOTEK, 4(1), 112-117.
- Mubarok, A. Y., & Chotijah, U. (2021). Penerapan Algoritma Genetika Untuk Mencari Optimasi Kombinasi Jalur Terpendek Dalam Kasus Travelling Salesman Problem. Jurnal Teknologi Terpadu, 7(2), 77-82. DOI: https://doi.org/10.54914/jtt.v7i2.424.
- Muhandhis, I., Shubhan, M., Dani, H. I., Rakasyah, A., Ritonga, A. S., & Sari, M. U. (2023). Pencarian Rute Terpendek Tim Promosi Kampus dengan Menggunakan Algoritma Genetik. Jurnal Teknologi dan Manajemen, 4(1), 6-12. DOI: https://doi.org/10.31284/j.jtm.2023.v4i1.4106.
- Oktaviandi, R. B., Hadi, M. S. T., Santoso, A. G., & El Maidah, N. (2019). Perbandingan Algoritma Genetika dengan Algoritma Greedy Untuk Pencarian Rute Terpendek. INFORMAL: Informatics Journal, 3(1), 6-11.
Similar Articles
Articles sharing related keywords and machine learning classifications:
Most read articles by the same author(s)
Other papers published by author(s) in this journal: