Simulasi Pengiriman Air Mineral Galon dengan Multi Depot Menggunakan  Hill Climbing dan Algoritma A*

Muhammad Dzulfikar Fauzi; Granita  Hajar; Desita  Nur Rachmaniar; Mohammad  Hamim Zajuli al Faroby

doi:10.55382/jurnalpustakaai.v5i2.1170

Penulis

Muhammad Dzulfikar Fauzi Telkom University
Granita Hajar Universitas Telkom
Desita Nur Rachmaniar Universitas Telkom
Mohammad Hamim Zajuli al Faroby Universitas Telkom

DOI:

https://doi.org/10.55382/jurnalpustakaai.v5i2.1170

Kata Kunci:

Depo, Hill Climbing, A Star

Abstrak

Air mineral sangat penting bagi kesehatan manusia karena berperan dalam hidrasi tubuh, menjaga keseimbangan cairan, dan mendukung fungsi organ serta sistem tubuh. Untuk memenuhi kebutuhan sehari-hari, distribusi dari depo air ke pelanggan harus mempertimbangkan rute tercepat agar biaya pengiriman efisien. Mencari rute terpendek dengan alokasi depo terbaik dengan tetap mempertimbangkan keterbatasan kapasitas masing-masing depo dan kendaraan merupakan tujuan dari penelitian ini. Algoritma Hill Climbing merupakan metode yang efektif untuk menentukan rute terdekat antar titik pengiriman. Selain itu, algoritma A* dapat digunakan untuk mencari rute optimal dengan menggunakan informasi tambahan (heuristik) yang mengarahkan pencarian ke jalur yang paling efisien. Berdasarkan hasil penelitian, 450,41 merupakan rute terjauh dengan menggunakan moda transportasi penjemputan dengan satu depo. Sedangkan untuk moda transportasi penjemputan dengan dua depo, jalur terpendek adalah 257,62; sedangkan untuk menggunakan sepeda motor atau kereta api, jalur terpendek adalah 271,75.

Unduhan

Data unduhan belum tersedia.

Referensi

A. Utamima, K. R. Pradina, N. S. Dini, and H. Studiawan, “Distribution Route Optimization of Gallon Water Using Genetic Algorithm and Tabu Search,” in Procedia Computer Science, Elsevier, 2015, pp. 503–510. doi: 10.1016/j.procs.2015.12.132.

R. P. Imantoro and S. Sahid, “OPTIMISASI RUTE DISTRIBUSI AIR MINERAL GALON HR BAROKAH PASAR KEMIS TANGERANG DENGAN MENGGUNAKAN LINGO,” Jurnal Kajian dan Terapan Matematika, vol. 8, no. 1, pp. 51–61, Aug. 2022, Accessed: Nov. 02, 2024. [Online]. Available: https://journal.student.uny.ac.id/jktm/article/view/18204/17391

M. Niu, R. Liu, and H. Wang, “A Max-Min Ant System based on Decomposition for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem,” 2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings, pp. 620–627, 2021, doi: 10.1109/CEC45853.2021.9504891.

R. Y. K. Fung, J. Tang, and J. Zhang, “A multi-depot vehicle routing problem with weight-related costs,” 2009 International Conference on Computers and Industrial Engineering, CIE 2009, pp. 1028–1033, 2009, doi: 10.1109/ICCIE.2009.5223962.

R. Fitriana, P. Moengin, and U. Kusumaningrum, “Improvement Route for Distribution Solutions MDVRP (Multi Depot Vehicle Routing Problem) using Genetic Algorithm,” in IOP Conference Series: Materials Science and Engineering, Institute of Physics Publishing, 2019. doi: 10.1088/1757-899X/528/1/012042.

N. and H. Md. M. Mahmud, 2019 International Conference on Electrical, Computer and Communication Engineering?: 7-9 February 2019, Cox’sBazar, Bangladesh. Institute of Electrical and Electronics Engineers, 2019.

L. Calvet, A. Ferrer, M. I. Gomes, A. A. Juan, and D. Masip, “Combining statistical learning with metaheuristics for the Multi-Depot Vehicle Routing Problem with market segmentation,” Comput Ind Eng, vol. 94, pp. 93–104, Apr. 2016, doi: 10.1016/J.CIE.2016.01.016.

B. Karadeniz, M. S. Erdogan, and Y. Kazanço?lu, “Vehicle Routing Problem with Multi Depot, Heterogeneous Fleet, and Multi Period: A Real Case Study,” Lecture Notes in Mechanical Engineering, pp. 826–836, 2022, doi: 10.1007/978-3-030-90421-0_70.

A. Agárdi, L. Kovács, and T. Bányai, “Two-Echelon Vehicle Routing Problem with Recharge Stations,” Transport and Telecommunication, vol. 20, no. 4, pp. 305–317, Dec. 2019, doi: 10.2478/ttj-2019-0025.

V. Y. I. Ilwaru, T. Sumah, Y. A. Lesnussa, Z. A. Leleury, ) Jurusan, and M. Fakultas, “Jurnal Ilmu Matematika dan Terapan | Desember 2017 |Volume 11 Nomor 2 | Hal.”

John Doe, “Introduction to Directed Graphs,” Proceedings of the IEEE Conference on Graph Theory and Applications, 2019.

Jane Smith, “An Overview of Undirected Graphs in Network Analysis,” IEEE Transactions on Network Science, 2020.

A. Johnson and B. Williams, “A Survey of Weighted Graphs and Their Applications in Network Analysis,” IEEE Transactions on Network Science, vol. 6, no. 2, pp. 123–136, 2021.

C. E. L. Thomas H. Cormen, Introduction to Algorithms, Third Edition, Third. London: The MIT Press, 2009. Accessed: Nov. 02, 2024. [Online]. Available: http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11866

P. Toth and D. Vigo, Vehicle Routing: Problems, Methods, and Applications. Bologna: Society for Industrial and Applied Mathematic, 2014. Accessed: Nov. 02, 2024. [Online]. Available: https://openlibrary.telkomuniversity.ac.id/home/catalog/id/176927/slug/vehicle-routing-problems-methods-and-applications.html