Penerapan Algoritma Simulated Annealing pada Proses Penentuan Rute Distribusi Cabai di Kota Yogyakarta
DOI:
https://doi.org/10.22441/pasti.2025.v19i3.001Keywords:
chili, distribution, distance, routes, simulated annealing, timeAbstract
Cabai merah merupakan komoditas penting yang dapat menunjang perekonomian dan kebutuhan pangan masyarakat. Oleh sebab itu, kepedulian instansi pertanian agar masyarakat mampu berswadaya untuk menanam cabai pun tinggi. Hal ini ditunjukkan dengan pemberian bantuan benih tanaman cabai kepada pemerintah Kota Yogyakarta untuk diberikan kepada sejumlah kelompok tani di wilayah tersebut. Bantuan tanaman benih cabai akan dilakukan secara continue maka dari itu penentuan rute distribusi yang optimal diperlukan untuk dapat menjaga kualitas bibit yang disalurkan. Penelitian ini menggunakan metode Simulated Annealing (SA) untuk menentukan rute terpendek dalam proses distribusi bibit cabai. Hasil yang diperoleh dari penentuan rute distribusi dengan menggunakan metode Simulated Annealing (SA) yang menerapkan 3 kombinasi parameter dan replikasi sebanyak 5 kali menunjukkan hasil terbaik berupa rute dengan total jarak tempuh yaitu 26,14 km dengan estimasi waktu distribusi yaitu 1 jam 12 menit. Hasil tersebut diperoleh dari penerapan parameter Simulated Annealing (SA) dengan nilai suhu awal (T0) = 50, suhu akhir (TF) = 0,001 dan koefisien pendinginan (α) = 0,99 pada replikasi ke 2. Dengan hasil ini maka jika diterapkan dalam kasus distribusi bibit cabai akan membuat proses pengirimannya menjadi lebih cepat karena memiliki jarak yang minimal.Downloads
References
Adhitama, L., Murniati, S., & Pramudyo, C. S. (2023b). 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. (2019a). 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
Redi, A. A. N. P., & Redioka, A. A. N. A. (2019b). 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.
Downloads
Published
How to Cite
Issue
Section
License
The copyright to this article is transferred to Universitas Mercu Buana (UMB) if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to UMB. The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.
We declare that:
1. This paper has not been published in the same form elsewhere.
2. It will not be submitted anywhere else for publication prior to acceptance/rejection by this Journal.
3. A copyright permission is obtained for materials published elsewhere and which require this permission for reproduction.
Furthermore, I/We hereby transfer the unlimited rights of publication of the above mentioned paper in whole to UMB. The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.
Retained Rights/Terms and Conditions
1. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in the Work.
2. Authors may reproduce or authorize others to reproduce the Work or derivative works for the authors personal use or for company use, provided that the source and the UMB copyright notice are indicated, the copies are not used in any way that implies UMB endorsement of a product or service of any employer, and the copies themselves are not offered for sale.
3. Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.
