Penerapan Algoritma Tabu Search pada Capacitated Vehicle Routing Problem Pengangkutan Sampah di Kota Padang Sidempuan

Authors

  • Rully Rumaida Universitas Islam Negeri Sumatera Utara
  • Fibri Rakhmawati Universitas Islam Negeri Sumatera Utara
  • Dedy Juliandri Universitas Islam Negeri Sumatera Utara

DOI:

https://doi.org/10.62383/algoritma.v2i5.201

Keywords:

Tabu Search Algorithm, Capacitated Vehicle Routing Problem, Waste Transportation

Abstract

Waste transportation activities are an example of a form of Capacitated Vehicle Routing Problem (CVRP) related to finding the minimum route. The Tabu Search algorithm is one of the metaheuristic methods that can guide the heuristic local search procedure to explore the solution area outside the local optimal point. The Tabu Search algorithm can be used to find the optimal VRP solution, namely the route that has the minimum total mileage by considering vehicle capacity. The purpose of this research is to determine the optimal route for garbage transportation in the Capacitated Vehicle Routing Problem (CVRP) model in Padang Sidempuan City using the Tabu Search algorithm. Based on the results of the study, it is concluded that the optimal route for transporting waste in the Capacitated Vehicle Routing Problem (CVRP) model in Padang Sidempuan City using the Tabu Search algorithm obtained the shortest route in iteration 1 with the route (12-11-10-9-8-7-6-5-4-3-2-1-0) and route length 16.55 km.

Downloads

Download data is not yet available.

References

Abubakar, R. (2021). Pengantar metodologi penelitian (1st ed.). SUKA-Press UIN Sunan Kalijaga.

Andrew, S. D., & Shaw, S. L. (2005). A GIS-based spatial decision support system for tourists of Great Smoky Mountains National Park. Journal Name, 269–278.

Azdy, R. A., & Darnis, F. (2019). Implementasi Bellman-Ford untuk optimasi rute pengambilan sampah di Kota Palembang. Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 8(4), 327-333.

Badan Pusat Statistik (ID). (2017). Laporan survei demografi 2017.

Berlianty, I., & Miftahol, A. (2010). Teknik-teknik optimasi heuristik. Yogyakarta: Graha Ilmu.

Budiasti. (2010). Dordrecht: Kluwer Academic Publishers.

Dalem, I. B. G. H. (2018). Penerapan algoritma A* (Star) menggunakan graph untuk menghitung jarak terpendek. Jurnal Resistor Rekayasa Sistem Komputer, 1(1), 41-47.

Eddy Prahasa. (2018). Sistem informasi grafis. Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 8(4), 313-329.

Gamayanti, N. (2017). Metaheuristics for the solution of dynamic vehicle routing problem with time windows (DVRPTW) with travel time variable. JAREE (Journal on Advanced Research in Electrical Engineering), 1(1), 8-13.

Gendreau, M., & Potvin, J. Y. (Eds.). (2010). Handbook of metaheuristics (2nd ed.). New York: Springer Science+Business Media.

Glover, F., & Kochenberger, G. A. (Eds.). (2003). Handbook of metaheuristics. Boston: Kluwer Academic Publishers.

Glover, F., & Laguna, M. (1997). Tabu search. Massachusetts: Kluwer Academic Publishers.

Hadiwiyoto, S. (1983). Penanganan dan pemanfaatan sampah. Yayasan Idayu.

Hartono. (2018). Vehicle routing problem. Departement de Mathematiques, MA-Ecublens, CH-1012: Lausanne.

Hertz, A., Taillard, E., & de Werra, D. (2002). A tutorial on tabu search. EPFL, Departement de Mathematiques, MA-Ecublens, CH-1015: Lausanne. Retrieved from http://www.cs.colostate.edu/~whitley/CS640/hertz92tutorial.pdf

Indrawati, et al. (2016). Penanganan dan pengolahan sampah. Universitas Mercu Buana.

Irman, A., Ekawati, R., & Febriana, N. (2017). Optimalisasi rute distribusi air minum Quelle dengan algoritma Clarke & Wright Saving dan model vehicle routing problem. In Seminar Nasional Inovasi dan Aplikasi Teknologi di Industri (pp. 1-7).

Iskandar, D., Masruri, A. A., & Saputra, D. (2018). Analisis penjadwalan produksi job shop pada UMKM di bidang konveksi dengan menggunakan algoritma tabu search (studi kasus di Panca Konveksi). Jurnal Ilmiah Teknik, 3(2), 21-27.

Note: Replace "Journal Name" with the actual journal name if available.

Poetra, F. H. (2010). Aplikasi algoritma tabu search pada pencarian jalur terpendek. (Unpublished undergraduate thesis). FMIPA Universitas Sumatera Utara, Medan.

Satria, W., Siallagan, M. P., & Novani, S. (2004). Penerapan metode algoritma genetik untuk memecahkan masalah penentuan rute kendaraan berkendala kapasitas. Universitas Komputer Indonesia.

Simanjuntak. (2019). Optimal rute pengangkutan sampah. (Unpublished undergraduate thesis). FMIPA Universitas Sumatera Utara, Medan.

Sugiono. (2017). Penelitian kuantitatif, kualitatif, dan R&D. Bandung: Alfabeta.

Sutarno, H., Priatna, N., & Nurjanah. (2003). Common textbook matematika diskrit.

Tchobagnolous. (1993). Zat organik sebagai investasi bangunan. Massachusetts: Kluwer Academic Publishers.

Tresna Sastrawijaya. (2019). Penanganan dan pemanfaatan sampah. Yayasan Idayu.

Varita, et al. (2018). Algoritma tabu search. In Handbook of metaheuristics (2nd ed.). New York: Springer Science+Business Media.

Yogaswara, Y., & Fatin, F. F. (2020). Penentuan rute dan penjadwalan pengangkutan sampah di Kota Bandung wilayah Bandung Barat dengan menggunakan tabu search. Jurnal Media Teknik Dan Sistem Industri, 4(1), 1-9.

Yuliza, et al. (2020). Rancangan rute menggunakan CVRP. Jurnal Resistor Rekayasa Sistem Komputer, 1(1), 29-32.

Published

2024-08-12

How to Cite

Rully Rumaida, Fibri Rakhmawati, & Dedy Juliandri. (2024). Penerapan Algoritma Tabu Search pada Capacitated Vehicle Routing Problem Pengangkutan Sampah di Kota Padang Sidempuan. Algoritma : Jurnal Matematika, Ilmu Pengetahuan Alam, Kebumian Dan Angkasa, 2(5), 215–227. https://doi.org/10.62383/algoritma.v2i5.201

Similar Articles

1 2 3 > >> 

You may also start an advanced similarity search for this article.