Efficient Route Planning for Flour Distribution: A Heuristic Approach

Authors

  • Said Muhammad Baisa Institut Teknologi Nasional Bandung
  • Arif Imran Institut Teknologi Nasional Bandung
  • Hilman Maulana Institut Teknologi Nasional Bandung
  • Alif Ulfa Afifah Institut Teknologi Nasional Bandung

DOI:

https://doi.org/10.32734/jsti.v26i2.17223

Keywords:

Distribution Route, Heuristics, Intra-Route, Nearest, Neighbour, Vehicle Routing Problem

Abstract

This company operates in the Food and Beverage sector, selling Martabak, an Indonesian snack. The company needs to deliver flour to 25 branches spread across Bandung, Indonesia, every day, with varying demand capacities at each branch. Each day, the total amount of flour to be delivered is 377 boxes. Currently, the company has 12 distribution routes with a total distance of 271,16 km, with each route covering only two stores. However, these routes are too many and vehicle capacities need to be optimized, resulting in a high total travelled distance.

The aim of this research is to optimize the delivery routes to reduce the total travelled distance and number of routes. To address this issue, known as the Vehicle Routing Problem (VRP), heuristic methods were employed, specifically the nearest neighbour method for initial route construction and Intra-Route (1-0) Insertion for improvement. Implementing these heuristic methods resulted in a final total of 6 distribution routes with a total distance of 160,90 km. This method successfully reduced the total travelled distance by 110,26 km and reduced the number of routes by 6. In conclusion, the application of heuristic methods in solving the VRP for this company proved to be effective in reducing both the total travelled distance and the number of routes, thereby enhancing the operational efficiency of the delivery process.

Downloads

Download data is not yet available.

References

T. R. Damayanti, A. L. Kusumaningrum, Y. D. Susanty, and S. Islam, "Route optimization using saving matrix method–a case study at public logistics company in indonesia," in International Conference on Industrial Engineering and Operations Management, 2020, pp. 1583-1591.

A. Rahmah and O. Venriza, "PENGOPTIMALAN DISTRIBUSI BBM SEBAGAI AKIBAT PENGARUH TOL BARU DI PALEMBANG PADA DEPOT A DAN B," in Prosiding Seminar Nasional Teknologi Energi dan Mineral, 2022, vol. 2, no. 1, pp. 716-725.

Z. A. Sirait and R. S. Lubis, "Completion of CVRP with a Combination of Sweep and Local Search Algorithms (Case Study: PT. AJW)," Numerical: Jurnal Matematika dan Pendidikan Matematika, vol. 7, no. 1, pp. 59-70, 2023.

G. D. Konstantakopoulos, S. P. Gayialis, and E. P. Kechagias, "Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification," Operational research, vol. 22, no. 3, pp. 2033-2062, 2022.

R. A. T. Saputro, Y. U. Kasanah, O. R. Marddani, and K. Niami, "Optimasi Rute Distribusi Unggas Berbasis Network Analysis-GIS Menggunakan Capacitated Vehicle Routing Problem with Time Window Pickup and Delivery," Jurnal INTECH Teknik Industri Universitas Serang Raya, vol. 10, no. 1, pp. 51-60, 2024.

D. Azizah, "Penentuan Rute Distribusi untuk Meminimalkan Biaya Pengiriman Tas Fashion (Studi Kasus di UD. Suwarlandono)(Determination of Distribution Routes to Minimize Shipping Costs for Fashion Bags (Case Study at UD. Suwarlandono))," Universitas 17 Agustus 1945 Surabaya, 2022.

E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, T. Vidal, and A. Subramanian, "New benchmark instances for the capacitated vehicle routing problem," European Journal of Operational Research, vol. 257, no. 3, pp. 845-858, 2017.

N. Labadie, C. Prins, and C. Prodhon, Metaheuristics for vehicle routing problems. John Wiley & Sons, 2016.

C. Lin, K. L. Choy, G. T. Ho, S. H. Chung, and H. Lam, "Survey of green vehicle routing problem: past and future trends," Expert systems with applications, vol. 41, no. 4, pp. 1118-1138, 2014.

R. Baldacci, A. Mingozzi, and R. Roberti, "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, vol. 218, no. 1, pp. 1-6, 2012.

F. Liu, C. Lu, L. Gui, Q. Zhang, X. Tong, and M. Yuan, "Heuristics for vehicle routing problem: A survey and recent advances," arXiv preprint arXiv:2303.04147, 2023.

G. D. Konstantakopoulos, S. P. Gayialis, E. P. Kechagias, G. A. Papadopoulos, and I. P. Tatsiopoulos, "A multiobjective large neighborhood search metaheuristic for the vehicle routing problem with time windows," Algorithms, vol. 13, no. 10, p. 243, 2020.

M. Blocho, "Heuristics, metaheuristics, and hyperheuristics for rich vehicle routing problems," in Smart Delivery Systems: Elsevier, 2020, pp. 101-156.

J. Pasha et al., "Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings," Advanced Engineering Informatics, vol. 52, p. 101623, 2022.

F. Armanda and R. F. Sari, "Optimization of Liquid Petroleum Gas (LPG) Gas Cylinder Distribution Route with Saving Matrix Method," Numerical: Jurnal Matematika Dan Pendidikan Matematika, vol. 7, no. 1, pp. 99-110, 2023.

J. M. Gutiérrez, M. Colebrook, C. Rivero, and T. Pestana, "Integration of a Heuristic Method into an ERP Software: A Successful Experience for a Dynamic Multi-item Lot Sizing Problem," in Advanced Business Analytics: Springer, 2014, pp. 21-37.

J. Oppen and A. Løkketangen, "A tabu search approach for the livestock collection problem," Computers & Operations Research, vol. 35, no. 10, pp. 3213-3229, 2008.

I. N. Pujawan and M. Er, Supply chain management edisi 3. Penerbit Andi, 2017.

E. Setterqvist, N. Kruglyak, and R. Forchheimer, "An improved nearest neighbour classifier," arXiv preprint arXiv:2204.13141, 2022.

Y. Safitri, F. Rakhmawati, and R. Aprillia, "DETERMINING THE OPTIMAL ROUTE OF BULOG RICE DISTRIBUTION USING SEQUENTIAL INSERTION AND NEAREST NEIGHBOUR METHOD," JIKO (Jurnal Informatika dan Komputer), vol. 7, no. 1, pp. 8-12, 2024.

H. Koswara, H. Adianto, and A. Nugraha, "Penentuan rute distribusi produk kaos pada dobujack inv. menggunakan metode nearest neighbour dan (1-0) insertion intra route," Jurnal Rekayasa Sistem & Industri (JRSI), vol. 4, no. 02, pp. 192-198, 2017.

A. Imran and L. Okdinawati, "Adaptation of the variable Neighborhood search heuristic to solve the vehicle routing problem," Jurnal Teknik Industri, vol. 12, no. 1, pp. 10-15, 2011.

A. Imran, M. Luis, and L. Okdinawati, "A variable neighborhood search for the heterogeneous fixed fleet vehicle routing problem," Jurnal Teknologi, vol. 78, no. 9, 2016.

Published

2024-07-29

How to Cite

Baisa, S. M., Imran, A., Maulana, H., & Afifah, A. U. (2024). Efficient Route Planning for Flour Distribution: A Heuristic Approach. Jurnal Sistem Teknik Industri, 26(2), 278-285. https://doi.org/10.32734/jsti.v26i2.17223