Perancangan Rute Optimal Distribusi Kargo Bahan Bakar Minyak dengan Metode Brute - Force Untuk Meminimasi Biaya Konsumsi Bahan Bakar Minyak Perusahaan Pelayaran PT XYZ

##plugins.themes.academic_pro.article.main##

Brissa Tiodora
Pratya Poeri Suryadhini
Nopendri Nopendri

Abstract

TSP of fuel oil distribution using tankers, the projected route search often does not contain the most minimal mileage, which can lead to adverse results such as significant additional costs. This research analyzes four different routes using several iterative proposals to reduce travel distance, time, and fuel costs compared to actual conditions. Problem solving is carried out using the Brute-Force method which enumerates all permutation results. The analysis results show that all proposed iterations were able to provide significant reductions in all three aspects. The four research routes achieved optimization results of 21,7% compared to the actual route modeling. This optimization proves that the iterative methods applied can substantially improve operational efficiency. Therefore, the determination of the tanker route must consider all the possibilities required in determining the route. The optimal route created is expected to have a new model with the aim of minimizing fuel costs based on the smallest distance and time calculations.

##plugins.themes.academic_pro.article.details##

How to Cite
Tiodora, B., Poeri Suryadhini, P. and Nopendri, N. (2024) “Perancangan Rute Optimal Distribusi Kargo Bahan Bakar Minyak dengan Metode Brute - Force Untuk Meminimasi Biaya Konsumsi Bahan Bakar Minyak Perusahaan Pelayaran PT XYZ”, Ranah Research : Journal of Multidisciplinary Research and Development, 6(6), pp. 2623-2632. doi: 10.38035/rrj.v6i6.1127.

References

Brodie, P. (1996). COMMERCIAL SHIPPING HANDBOOK.
Chopra, S., & Meindl, P. (2007). Supply chain management : strategy, planning, and operation. Pearson Prentice Hall.
Kenneth R. Baker. (2019). Principles of Sequencing and Scheduling.
Misa, T. J. (2010). Interview: An interview with Edsger W. Dijkstra. In Communications of the ACM (Vol. 53, Issue 8, pp. 41–47). https://doi.org/10.1145/1787234.1787249
Rahman Saiyed, A. (2012). The Traveling Salesman problem.
Shi, Y., & Zhang, Y. (2021). The neural network methods for solving Traveling Salesman Problem. Procedia Computer Science, 199, 681–686. https://doi.org/10.1016/j.procs.2022.01.084
Sianturi, G. A. (2022). Penerapan Algoritma Brute Force dalam Pencarian Rute Optimal untuk Survei Kos di Bandung dengan Google Maps API. http://jurusanku.com/utstraffic/