USULAN RUTE PENDISTRIBUSI MENGGUNAKAN ALGORITMA CLARKE AND WRIGHT SAVINGS DAN SEQUENTIAL INSERTION

Authors

  • Arif Chandra Setiawan Arif Universitas Teknologi Yogyakarta
  • Suseno Suseno Universitas Teknologi Yogyakarta

DOI:

https://doi.org/10.59024/jisi.v2i3.727

Keywords:

Distribution Routes, Clarke and Wright Savings Algorithma, Sequential Insertion

Abstract

In this research, data was taken from the distribution route which was recorded by the cashier at the Cahaya Kristal Tube Ice Ice Factory which is located on Jl, Damai, Prujakan Tambakan Village, Sinduharjo, Ngaglik, Sleman Yogyakarta. Then the data is processed using the Clarke and Wright Savings Algorithm and Sequential Insertion with the aim of providing the best or most effective route suggestions and then comparing the two methods to produce the Travel Route Distance and Distribution Costs. By using the Clarke and Wright Saving Algorithm, we get 2 vehicle routes which produce a combined route of 72 km with a daily distribution cost of IDR 147,000, and for the sequential insertion algorithm method we also get 2 vehicle routes which produce a combined route of 107 km with a daily distribution cost of IDR 182,000. Thus it can be concluded that routes formed using the Clarke and Wright Savings Algorithm are more effective and economical compared to routes formed using the Sequential Insertion

References

Dechandra, R. N., Fmipa, M., Himmawati, U., Lestari, P., Matematika, P., & Uny, F. (2022). Penerapan hibridisasi algoritma sequential insertion heuristic dan algoritma simulated annealing pada penentuan rute kendaraan pengangkut sampah di Kota Yogyakarta Application of hybridization of sequential insertion heuristic algorithm and simulated annealing algorithm and its application in determining the route of garbage transport vehicles in the City of Yogyakarta. In Jurnal Kajian dan Terapan Matematika (Vol. 8, Issue 3). http://journal.student.uny.ac.id/ojs/index.php/jktm:

Engraini, V., Meirizha, S. N., & Dermawan, D. (2020a). Optimasi Vehicle Routing Problem di PT. XYZ Menggunakan Metode Clarke and Wright Saving Heuristic dan Nearest Neighbour (Issue SNTIKI).

Engraini, V., Meirizha, S. N., & Dermawan, D. (2020b). Optimasi Vehicle Routing Problem di PT. XYZ Menggunakan Metode Clarke and Wright Saving Heuristic dan Nearest Neighbour (Issue SNTIKI).

Rachman Afandy, F., & Fayaqun, R. (2023). Optimasi Pendistribusi Barang Dengan Metode Clarke And Wright (Saving Heuristic) Dan Metode Nearest Neighbour. Jurnal Locus Penelitian Dan Pengabdian, 2(8), 833–845. https://doi.org/10.58344/locus.v2i8.1589

Reza Riansyah, M., Abdi Setiawan, B., Yusuf, A., & Maulina, D. (2022). Penentuan Keputusan Rute Distribusi Terbaik Menggunakan Capacitated Vehicle Routing Problem (CVRP) Determining the Best Distribution Route Decision Using Capacitated Vehicle Routing Problem (CVRP) (Vol. 14, Issue 1).

Downloads

Published

2024-05-24

Issue

Section

Articles