PENENTUAN RUTE OPTIMAL PADA DISTRIBUSI BARANG MENGGUNAKAN ALGORITMA GREEDY (Studi Kasus : UD.XYZ)
Abstract
The distribution of goods is an important thing that must consider in the continuity of a business. The better the distribution of goods will have an impact on increasing customer satisfaction. UD XYZ is a distributor of motorcycle masks in Surabaya. The distribution route, which is carried out every day, does not have a fixed route selection reference and is constantly changing without a clear basis. The distribution process often experiences delays in the delivery of goods. For this reason, optimization is needed in determining the optimal distribution route to save time, costs, and other operations. A greedy algorithm is one of the algorithms used to determine the optimal solution. The greedy algorithm is an algorithm that follows a problem-solving heuristic making a locally optimal choice at each stage in the hope of finding a global optimal. With the implementation of the greedy algorithm, this research produces an optimal distance and can provide benefits to UD XYZ.
Keywords: Distribution of goods, optimization, distribution routes, greedy algorithm
ABSTRAK
Distribusi barang merupakan hal penting yang harus diperhatikan pada keberlangsungan sebuah bisnis. Semakin baik distribusi barang maka akan berdampak terhadap meningkatnya kepuasan pelanggan. UD XYZ merupakan salah satu distributor masker motor di Surabaya. Rute distribusi yang setiap hari dilakukan tidak memiliki acuan pemilihan rute yang tetap dan selalu berubah – ubah tanpa ada dasar yang jelas, sehingga proses distribusi sering mengalami kendala keterlambatan pengiriman barang. Untuk itu diperlukan optimasi dalam menentukan rute distribusi yang optimal agar lebih menghemat waktu, biaya dan operasional lainnya. Algoritma greedy merupakan salah satu algoritma yang digunakan untuk menentukan solusi optimal. Algoritma greedy adalah algoritma yang mengikuti heuristik pemecahan masalah membuat pilihan optimal lokal pada setiap tahap dengan harapan menemukan optimal global Pada penelitian ini, pemilihan lokal digambarkan dengan node – node yang diterapkan sebagai lokasi distribusi barang kemudian memilih jalur terbaik antar lokasi distribusi. Dengan implementasi algoritma greedy, penelitian ini mengasilkan jarak yang optimal dan mampu memeberikan keuntungan pada UD XYZ
Kata Kunci: Distribusi barang, optimasi, rute distribusi, algoritma greedy
Downloads
References
K. Auliasari, M. Kertaningtyas, and D. W. L. Basuki, “Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem,” Jurnal Sains, Teknologi dan Industri, vol. 16, no. 1, 2018.
D. T. Wiyanti, “Algoritma Optimasi Untuk Penyelesaian Travelling Salesman Problem,” Jurnal Transformatika, vol. 11, no. 1, 2013.
M. D. A. Cipta Hasibuan and L. -, “Pencarian Rute Terbaik Pada Travelling Salesman Problem (TSP) Menggunakan Algoritma Genetika pada Dinas Kebersihan dan Pertamanan Kota Pekanbaru,” SATIN - Sains dan Teknologi Informasi, vol. 1, no. 1, 2016.
S. Rohman, L. Zakaria, A. Asmiati, and A. Nuryaman, “Optimisasi Travelling Salesman Problem dengan Algoritma Genetika pada Kasus Pendistribusian Barang PT. Pos Indonesia di Kota Bandar Lampung,” Jurnal Matematika Integratif, vol. 16, no. 1, p. 61, 2020.
Mutia Hasanah, Nazaruddin Matondang, and Aulia Ishak, “Penentuan Rute Distribusi Barang yang Optimal dengan Menggunakan Algoritma Heuristik pada PT. XYZ,” Jurnal Teknik Industri USU, vol. 3, no. 3, 2013.
A. Januantoro and R. Sarno, “Repair and replacement strategy for optimizing cost and time of warranty process using integer programming,” Telkomnika (Telecommunication Computing Electronics and Control), vol. 16, no. 6, 2018.
H. A. Abdulkarim and I. F. Alshammari, “Comparison of Algorithms for Solving Traveling Salesman Problem,” International Journal of Engineering and Advanced Technology, vol. 4, no. 6, pp. 76–79, 2015.
M. F. A. Sahputra, R. N. Devita, S. A. Siregar, and K. C. Kirana, “Implementation of Traveling Salesman Problem ( TSP ) based on Dijkstra ’ s Algorithm in Logistics System,” International Journal of Electrical and Electronics Engineering, vol. 14, no. 1, pp. 39–44, 2016.
B. C. Geiger and G. Böcherer, “Greedy algorithms for optimal distribution approximation,” Entropy, vol. 18, no. 7, 2016.
M. Z. Usman and T. Oktiarso, “Implementasi Algoritma Greedy untuk Menyelesaikan Travelling Salesman Problem di Distributor PT . Z,” Journal of Integrated System, vol. 1, no. 2, pp. 216–229, 2018.
H. Fahmi, M. Zarlis, E. B. Nababan, and P. Sihombing, “Implementation of the Greedy Algorithm to determine the nearest route Search in distributing food production,” IOP Conference Series: Materials Science and Engineering, vol. 769, no. 1, pp. 0–7, 2020.
S. Ejim and R. N. D, “Implementation of Greedy Algorithm in Travel Salesman Problem,” no. September, pp. 1–8, 2012.
D. L. Ichsan, L. D. N. Reni, and P. K. Abiyasa, “Menentukan jalur terpendek dalam mengunjungi museum di yogyakarta dengan traveling salesman problem (tsp),” pp. 32–37, 1800.
Y. D. Mahendra, N. Nuryanto, and A. Burhanuddin, “Sistem Penentuan Jarak Terdekat dalam Pengiriman Darah di PMI Kota Semarang dengan Metode Algoritma Greedy,” Jurnal Komtika, vol. 2, no. 2, 2019.
Y. Liu, E. K. P. Chong, A. Pezeshki, and Z. Zhang, “Submodular optimization problems and greedy strategies: A survey,” Discrete Event Dynamic Systems: Theory and Applications, vol. 30, no. 3, 2020.
A. Kosasih, Y. D. Aprianto, Sukardi, M. Sya’Roni, and R. Setiadi, “Application of the Hamilton circuit algorithm for optimal route search in city transport routes,” International Journal of Mechanical Engineering and Technology, vol. 9, no. 8, 2018.
Authors whose manuscript is published will approve the following provisions:
- The right to publication of all journal material published on the Konvergensi Teknologi Informasi & Komunikasi website is held by the editorial board with the author's knowledge (moral rights remain the property of the author).
- The formal legal provisions for access to digital articles of this electronic journal are subject to the terms of the Creative Commons Attribution-ShareAlike (CC BY-SA) license, which means Konvergensi Teknologi Informasi & Komunikasi reserves the right to store, modify the format, administer in database, maintain and publish articles without requesting permission from the Author as long as it keeps the Author's name as the owner of Copyright.
- Printed and electronic published manuscripts are open access for educational, research and library purposes. In addition to these objectives, the editorial board shall not be liable for violations of copyright law.
