Determination Of Delivery Routes For Food Materials At Healthy Food Brand Outlets In Bandung City Using Nearest Neighbor And Nearest Insertion Methods

Authors

  • Irwan Yulianto Universitas Ma'soem
  • Arida Murti Martikasari University of International Logistics and Business, Bandung, Indonesia

DOI:

https://doi.org/10.31004/jestm.v5i2.298

Keywords:

Effectiveness of Distribution, Delivery Route, Vehicle Routing Problem, Nearest Neighbor, Insertion Methods

Abstract

Efficient distribution is a critical factor in the food sales industry to ensure product quality, cost effectiveness, and customer satisfaction. The reliance on third-party online delivery services for distributing raw food ingredients has created significant logistics costs for a healthy food company in Bandung. To address this issue, the company aims to manage its own logistics using available delivery vehicles. The main challenge lies in determining the optimal delivery route that minimizes time and cost while serving an increasing number of outlets. This study applies a constructive heuristic approach to the Vehicle Routing Problem (VRP), since no prior research has examined delivery routes for this company. Constructive heuristics are chosen for their ability to provide feasible solutions that are easy and quick to implement. Two methods are employed: the Nearest Neighbor and the Nearest Insertion. The results indicate that the Nearest Neighbor method produces a total distance of 70.3 km, while the Nearest Insertion yields 68.1 km. Thus, the Nearest Insertion method achieves a shorter route by 2.2 km, equivalent to a 3.1% reduction compared with Nearest Neighbor. Based on these findings, the Nearest Insertion method is selected as the optimal route. This research provides a practical initial framework for improving logistics efficiency in food distribution and can serve as a foundation for future optimization studies.

References

Abadi, C., Susanty, S., & Adianto, H. (2014). Penentuan Rute Kendaraan Distribusi Produk Roti Menggunakan Metode Nearest Neighbor dan Metode Sequential Insertion *. Jurusan Teknik Industri Itenas | No.03 | Vol.01.

Asteria C. (2008). Penentuan Rute Distribusi Dengan Algoritma Tabu Search Untuk Vrp Dengan Time Windows (Studi Kasus Di Pt.X) Tesis Oleh : Clarissa Asteria 0606004325 Program Studi Teknik Industri Program Pasca Sarjana Bidang Ilmu Teknik Universitas Indonesia 2008.

Cover, T. M., & Hart, P. E. (1952). Approximate formulas for the information transmitted bv a discrete communication channel. In IEEE Transactions On Information Theory (Vol. 24, Issue 1).

Dantzig G. B., & Ramser J. H. (1959). THE TRUCK DISPATCHING PROBLEM.

Heizer, J., Render, B., & Munson, C. (2024). Operations Management Sustainability and Supply Chain Management Fourteenth Edition. https://support.pearson.com/getsupport

Kumar, S. N., & Panneerselvam, R. (2012). A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management, 04(03), 66–74. https://doi.org/10.4236/iim.2012.43010

Martikasari, A. M., & Yulianto, I. (2024). Proposed Package Distribution Routes at PT. Pos Indonesia Mail Processing Center Bandung. Sainteks: Jurnal Sain Dan Teknik, 6(2), 203–213. https://doi.org/10.37577/sainteks.v6i02.656

Octora, L., Imran, A., & Susanty, S. (2014). Pembentukan Rute Distribusi Menggunakan Algoritma Clarke & Wright Savings dan Algoritma Sequential Insertion *.

Santoso, S., Nurhidayat, R., Mahmud, G., & Arijuddin, A. M. (2021). Measuring the Total Logistics Costs at the Macro Level: A Study of Indonesia. Logistics, 5(4). https://doi.org/10.3390/logistics5040068

Suparmi, Suyitno H., & Rosyida I. (2020). Pengoptimalan Rute Distribusi Produk Tisu Di Cv Maple Semarang Dengan Menggunakan Metode Saving Matrix Dan Nearest Insertion.

Suryani, Kuncoro D.K.R., & Fathimahhayati L. D. (2018). Perbandingan Penerapan Metode Nearest Neighbour Dan Insertion Untuk Penentuan Rute Distribusi Optimal Produk Roti Pada Ukm Hasan Bakery Samarinda. Profisiensi: The Journal of the Industrial Engineering Study Program.

Toth P., & Vigo D. (2002). THE VEHICLE ROUTING PROBLEM.

Winangun, A., & Baisa, M. (2023). Penentuan Rute Kendaraan Menggunakan Algoritma Sweep, Nearest Neighbor Dan Metode Local Search Di PT XYZ.

Yeun, L. C., Ismail W.R, Omar K., & Zirour M. (2008). Vehicle Routing Problem: Models And Solutions. In Journal of Quality Measurement and Analysis JQMA (Vol. 4, Issue 1).

Zheng, W., Liao, Z., Qin, J., Zheng, W., & Zhixue, L. (2017). Using a four-step heuristic algorithm to design personalized day tour route within a tourist attraction.

Downloads

Published

2025-09-30

How to Cite

Yulianto, I., & Martikasari, A. M. (2025). Determination Of Delivery Routes For Food Materials At Healthy Food Brand Outlets In Bandung City Using Nearest Neighbor And Nearest Insertion Methods. Journal of Engineering Science and Technology Management (JES-TM), 5(2), 276–281. https://doi.org/10.31004/jestm.v5i2.298