Penerapan Algoritma Simulated Annealing pada Proses Penentuan Rute Distribusi Cabai di Kota Yogyakarta

Lukman Adhitama; Siti Dinar Rezki Ramadhani

doi:10.22441/pasti.2025.v19i3.001

Authors

Lukman Adhitama Program Studi Teknik Logistik, Universitas Telkom, Kampus Purwokerto, Jl. DI Panjaitan No.128, Purwokerto 53147, Jawa Tengah, Indonesia, Indonesia
Siti Dinar Rezki Ramadhani Teknik Industri, Institut Teknologi Perkebunan Pelalawan Indonesia, Pangkalan Kerinci Kota, Kec. Pangkalan Kerinci, Kabupaten Pelalawan 28654, Riau, Indonesia, Indonesia

DOI:

https://doi.org/10.22441/pasti.2025.v19i3.001

Keywords:

Distribution, Distance, Routes, Simulated Annealing, Time

Abstract

Red chili peppers are an important commodity that supports the economy and fulfills the community’s food needs. Therefore, agricultural agencies have shown strong commitment to encouraging communities to achieve self-sufficiency in chili cultivation. This commitment is demonstrated by providing chili seedlings to the Yogyakarta City Government for distribution to several farmer groups in the area. Since the distribution of chili seedlings will be carried out continuously, determining optimal distribution routes is necessary to maintain seedling quality. This study applies the Simulated Annealing (SA) method to determine the shortest route for chili seedling distribution. The results, obtained using three parameter combinations and five replications, indicate that the best distribution route has a total travel distance of 26.14 km and an estimated distribution time of 1 hour and 12 minutes. This result was achieved using the Simulated Annealing (SA) parameters of an initial temperature (T0) of 50, a final temperature (TF) of 0.001, and a cooling coefficient (α) of 0.99 in the second replication. These findings suggest that implementing the proposed route for chili seedling distribution could accelerate the delivery process by minimizing the total travel distance.

Downloads

Download data is not yet available.

References

Adhitama, L., Murniati, S., & Pramudyo, C. S. (2023). Minimasi Jarak Pengiriman Roti Cv. Twin Setia Dengan Metode K-Means Clustering Dan Simulated Annealing. Jurnal Teknik SILITEK, 03(02), 1–8.

Anggarsari, F., Mahmudy, W. F., & Dewi, C. (2017). Optimasi Kebutuhan Gizi untuk Balita Menggunakan Hybrid Algoritma Genetika dan Simulated Annealing. Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, 1(12), 1668–1677.

Asih, A. M. S., Sopha, B. M., & Kriptaniadewa, G. (2017). Comparison study of metaheuristics: Empirical application of delivery problems. International Journal of Engineering Business Management, 9, 184797901774360. https://doi.org/10.1177/1847979017743603

Darina, S., Wibowo, A. T., & Ridwan, M. (2021). Penggunaan Algoritma Simulated Annealing Untuk Menyelesaikan Masalah Vehicle Routing Pada Rute Distribusi Supermarket Simulated Annealing Algorithm For Solving Vehicle Routing Problems On Supermarket Distribution Routes. 6(2).

Fauzi, A., Andriani, V., Febrian, A. Z., Apriyana, G., Syamia Sella, B., Abdillah Akbar, R., & Fadhillah, M. F. (2023). Pengaruh Meningkatnya Harga Cabai Terhadap Permintaan Dan Penawaran Di Indonesia. Jurnal Akuntansi dan Manajemen Bisnis, 3(1), 73–79. https://doi.org/10.56127/jaman.v3i1.645

Ferreira, K. M., & De Queiroz, T. A. (2018). Two effective simulated annealing algorithms for the Location-Routing Problem. Applied Soft Computing, 70, 389–422. https://doi.org/10.1016/j.asoc.2018.05.024

Novianda, R. F., Martini, S., & Aurachman, R. (2017). Penentuan Rute Armada Menggunakan Alogaritma Tabu Search Pada Homogenus Fleet Vehicle Routing Problem With Time Windows Di Pt. Xyz Wilayah Bandung Untuk Meminimasi Total Waktu Tempuh. e-Proceeding of Engineering, Vol.4, No.2, 2892–2899.

Ramadhani, S. D. R., Tanggono, H. A., & Yusuf, R. (2021). Optimasi Rute Distribusi Menggunakan Metode Tabu Search Perusahaan Daerah Air Minum (PDAM) Tirta Bangun Kulon Progo. Proceedings Series on Physical & Formal Sciences, 1, 56–60. https://doi.org/10.30595/pspfs.v1i.134

Redi, A. A. N. P., Jewpanya, P., Kurniawan, A. C., Persada, S. F., Nadlifatin, R., & Dewi, O. A. C. (2020). A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities. Algorithms, 13(9), 218. https://doi.org/10.3390/a13090218

Redi, A. A. N. P., & Redioka, A. A. N. A. (2019). Algoritma Simulated Annealing untuk Optimasi Rute Kendaraan dan Pemindahan Lokasi Sepeda pada Sistem Public Bike Sharing. Jurnal Sistem dan Manajemen Industri, 3(1), 50. https://doi.org/10.30656/jsmi.v3i1.1473

Winarno, W., & Redi, A. A. N. P. (2020). Analisa Perbandingan Metode Simulated Annealing Dan Large Neighborhood Search Untuk Memecahkan Masalah Lokasi Dan Rute Kendaraan Dua Eselon. Jurnal Manajemen Industri dan Logistik, 4(1), 35–46. https://doi.org/10.30988/jmil.v4i1.311

Wirdianto, E., & Surya, B. (2007). Penerapan Algoritma Simulated Annealing Pada Penjadwalan Distribusi Produk. Jurnal Optimasi Sistem Industri, Vol. 7 No. 1, 7–20.

Yu, V. F., Indrakarna, P. A. Y., Redi, A. A. N. P., & Lin, S.-W. (2021). Simulated Annealing with Mutation Strategy for the Share-a-Ride Problem with Flexible Compartments. Mathematics, 9(18), 2320. https://doi.org/10.3390/math9182320

Yuditya, A., Hardjanto, A., & Sehabudin, U. (2023). Fluktuasi Harga dan Integrasi Pasar Cabai Merah Besar (Studi Kasus: Pasar Induk Kramat Jati dan Pasar Eceran di DKI Jakarta). Indonesian Journal of Agricultural, Resource and Environmental Economics, 2(1), 1–13.