Penerapan Metode Simple Hill Climbing dalam Menentukan Rute Terpendek Distribusi Usaha Bolu Dedek

Mutiara Putri -
Yusmet Rizal -

Abstract


Traveling Salesman Problem (TSP) is a problem related to a seller who are required to visit a number of different cities once only, and return to his hometown. This research aims to determine the shortest route in the distribution of Dedek's Bolu Enterprises using the Simple Hill Climbing method. The benefits of this method are to solve the problem of finding the shortest route starting from improving the initial solution by evaluating the current solution and considering neighboring solutions that have better objective function values. If present, the current solution is upgraded by selecting that neighbor solution. This steps are repeated until there is no neighbor solution that has a better objective function value, indicates that the local optimum value that has been achieved. Based on the results of the research, the latest route was obtained with a distance of 57.2 km on the combined route, namely O-A-B-C-D-F-E-G-I-J-H-O or 4.5 km shorter than the distribution route normally used by business owners.


Full Text:

PDF

References


T. U. Hasanah, P. Utami, dan M. Fauzi, “Pengoptimalan Biaya Transportasi dengan Metode North West Corner (NWC) dan Stepping Stone (SS) Untuk Distribusi Produk Farmasi,” Jurnal Teknik Industri, 6(1), 34-39. 2020.

K. Auliasari, M. Kertaningtyas, dan D. W. L. Basuki, “Optimalisasi Rute Distribusi Produk Menggunakan Metode Travelling Salesman Problem,” 16(1), 15-23. 2018.

R. D. M. Sukma, “Prosedur Pendistribusian Barang Milik Ajinomoto Sales Indonesia Pada PT. Ajinomoto Indonesia,” (Doctoral dissertation, STIE Perbanas Surabaya). 2019.

F. F. Rufliansah dan A. H. D. Seno, “Pengaruh Harga dan Kualitas Produk Terhadap Kepuasan Konsumen (Studi pada Konsumen Rainbow Creative Semarang),” Jurnal Ilmu Administrasi Bisnis, 9(4), 389-401. 2020.

R. Hardian, “Perbandingan Penerapan Algoritma Tabu Search dan Simple Hill Climbing Dalam Mencari Rute Optimal Yang Dilalui Mobil PT. Tiki Jalur Nugraha Ekakurir (JNE) Wilayah Kota Jambi,” (Doctoral dissertation, Universitas Jambi). 2022.

Fatmawati, B. Prihandono, dan E. Noviani, “Penyelesaian Travelling Salesman Problem Dengan Metode Tabu Search,” Buletin Ilmiah Mat. Stat. dan Terapannya (Bimaster), 04(1), 17-24. 2015.

A. Satriyo, “Penerapan Metode Simple Hill Climbing Dalam Menentukan Rute Terpendek Pada Pengiriman (Studi Kasus di Supplier Hotel),”

JISO: Journal of Industrial and Systems Optimization, 3(2), 79-83. 2020.

M. I. Dwiputranti dan V. M. Putri, “Penerapan Branch and Bound Untuk Alternatif Pemilihan Rute Terpndek Dalam Pengiriman Dokumen Pada Perusahaan Freight Forwarder,” Jurnal Logistik Bisnis, 10(02), 42-45. 2020.

A. Syarif. Algoritm Genetika: Teori dan Aplikasi. Edisi Kedua. Yogyakarta: Graha Ilmu. 2014.

M. Taufiq, A. Suyitno, dan D. Dwijanto, “Menentukan Rute Terpendek dengan Memanfaatkan Metode Heuristik Berbasis Algoritma A,” Indonesian Journal of Mathematics and Natural Sciences, 42(1), 43-51. 2019.

M. Tandaliling, “Sistem Informasi Pencarian Rute Terdekat Stasiun Pengisian Bahan Bakar Umum (SPBU) Metode Simple Hill Climbing,” Jurnal Sistem Informasi SIBerPro: Jurnal Manajemen Informatika, 3(1), 43-54. 2018.

S. Kusumadewi dan H. Purnomo. Penyelasaian Masalah Optimasi dengan Teknik-Teknik Heuristik. Edisi Pertama. Yogyakarta: Graha Ilmu. 2005.

Priyono. Metode Penelitian Kuantitatif. Sidoarjo: Zifatama Publishing. 2016.

S. Arikunto. Prosedur Penelitian, Suatu Pendekatan Praktik. Jakarta: Rinneka Cipta. 2006.

R. Munir. Matematika Diskrit. Ed Ketiga. Bandung: Informatika Bandung. 2010.




DOI: http://dx.doi.org/10.24036/unpjomath.v8i3.14947