Modeling Fresh Product Delivery Routes with Heterogeneous Vehicle Routing Problem with Time Windows and Multi-Trips Model:
A Case Study
Keywords:
vehicle routing problem, Logistics, HVRPTWMT, Fresh Chicken Meat., Route OptimizationAbstract
This study develops a Heterogeneous Vehicle Routing Problem with Time Windows and Multi-Trips (HVRPTWMT) model designed to minimize delivery distances for fresh products. The model addresses complex operational constraints inherent in real-world logistics, including time windows, heterogeneous fleets, and multi-trip requirements. A quantitative approach was employed to formulate the HVRPTWMT model, which was then solved using an analytical method to ensure a global optimum solution was found. The model's efficacy was demonstrated through its application to historical data from April 10, 2025, yielding an optimal total distance of 774.45 km across six efficient routes. Sensitivity analysis confirmed the model's robustness and responsiveness to critical parameter changes, such as vehicle capacity, demand fluctuations, and time limits. The developed HVRPTWMT model provides a globally optimal and rule-compliant solution for complex fresh product delivery logistics.
Downloads
References
[1] K. V. Narasimha, E. Kivelevitch, B. Sharma and M. Kumar, “An ant Colony optimization technique for solving the min-max multi-depot vehicle routing problem,” Swarm and Evolutionary Computation, vol. 13, December 2013, doi: https://doi.org/10.1016/j.swevo.2013.05.005
[2] S. Sirajuddin, G. Bhaswara, and A. Gunawan, “Model sistem dinamis industri ayam pedaging dalam memenuhi kebutuhan daging ayam,” Journal Industrial Servicess, vol. 8, no. 1, p. 53, Jun. 2022, doi: https://doi.org/10.36055/jiss.v8i1.14184.
[3] U. Dedović and B. A. Gušavac, “Optimal vehicle routing in consumer goods distribution: A GNU linear programming kit-based analysis,” Acadlore Transactions on Applied Mathematics and Statistics, vol. 1, no. 2, pp. 87–95, Sep. 2023, doi: https://doi.org/10.56578/atams010204.
[4] D. S. Ramadhani, N. A. Masruroh, and J. Waluyo, “Model of vehicle routing problem with split delivery multi trips, multi products and compartments for determining fuel distribution Routes,” ASEAN Journal of System Engineering, vol. 5, pp. 51–55, Dec. 2021, [Online]. Available: http://journal.ugm.ac.id/index.php/ajse
[5] N. Huang, J. Li, W. Zhu, and H. Qin, “The multi-trip vehicle routing problem with time windows and unloading queue at depot,” Transp Res E Logist Transp Rev, vol. 152, Aug. 2021, doi: https://doi.org/10.1016/j.tre.2021.102370.
[6] S. Madankumar and C. Rajendran, “A mixed integer linear programming model for the vehicle routing problem with simultaneous delivery and pickup by heterogeneous vehicles, and constrained by time windows,” Sādhanā, vol. 44, no. 2, p. 39, Feb. 2019, doi: https://doi.org/10.1007/s12046-018-1048-y.
[7] Y. Zhang and J. Li, “A Hybrid Heuristic Harmony Search Algorithm for the Vehicle Routing Problem with Time Windows,” IEEE Access, vol. 12, pp. 42083–42095, 2024, doi: https://doi.org/10.1109/ACCESS.2024.3378089.
[8] B. Pan, Z. Zhang, and A. Lim, “Multi-trip time-dependent vehicle routing problem with time windows,” Eur J Oper Res, vol. 291, no. 1, pp. 218–231, May 2021, doi: https://doi.org/10.1016/j.ejor.2020.09.022.
[9] D. Taş, O. Jabali, and T. Van Woensel, “A vehicle routing problem with flexible time windows,” Comput Oper Res, vol. 52, no. PART A, pp. 39–54, 2014, doi: https://doi.org/10.1016/j.cor.2014.07.005.
[10] P. Sitek, J. Wikarek, K. Rutczyńska-Wdowiak, G. Bocewicz, and Z. Banaszak, “Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach,” Neurocomputing, vol. 423, pp. 670–678, 2021, doi: https://doi.org/10.1016/j.neucom.2020.02.126.
[11] C. K. Y. Lin, “A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources,” Comput Oper Res, vol. 38, no. 11, pp. 1596–1609, Nov. 2011, doi: https://doi.org/10.1016/j.cor.2011.01.021.
[12] J. W. Escobar, J. L. R. Duque, and R. García-Cáceres, “A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet,” International Journal of Industrial Engineering Computations, vol. 13, no. 1, pp. 135–150, Dec. 2022, doi: https://doi.org/10.5267/j.ijiec.2021.6.001.
[13] B. Souleymane, D. Oussama, A. Fatima Ezzahra, and R. Fouad, “A Time Window Assignment Strategy for Dynamic Vehicle Routing Problem,” in Transportation Research Procedia, Elsevier B.V., 2025, pp. 169–176. doi: https://doi.org/10.1016/j.trpro.2025.03.060.
[14] A. Maroof, B. Ayvaz, and K. Naeem, “Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem with Time Windows (VRPTW),” IEEE Access, vol. 12, pp. 36974–36989, 2024, doi: https://doi.org/10.1109/ACCESS.2024.3373699.
[15] V. F. Yu, P. Jodiawan, S. W. Lin, W. F. Nadira, A. M. S. Asih, and L. N. H. Vinh, “Using Simulated Annealing to Solve the Multi-Depot Waste Collection Vehicle Routing Problem with Time Window and Self-Delivery Option,” Mathematics, vol. 12, no. 3, Feb. 2024, doi: https://doi.org/10.3390/math12030501.
[16] P. Lou, Z. Zhou, Y. Zeng, and C. Fan, “Vehicle routing problem with time windows and carbon emissions: a case study in logistics distribution,” Environmental Science and Pollution Research, vol. 31, no. 29, pp. 41600–41620, Jun. 2024, doi: https://doi.org/10.1007/s11356-024-31927-9.
[17] D. Wu, J. Li, J. Cui, and D. Hu, “Research on the Time-Dependent Vehicle Routing Problem for Fresh Agricultural Products Based on Customer Value,” Agriculture (Switzerland), vol. 13, no. 3, Mar. 2023, doi: https://doi.org/10.3390/agriculture13030681.
[18] D. Wu and C. Wu, “Research on the Time‐Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows,” Agriculture (Switzerland), vol. 12, no. 6, Jun. 2022, doi: https://doi.org/10.3390/agriculture12060793.
[19] Q. Liu et al., “2D-Ptr: 2D Array Pointer Network for Solving the Heterogeneous Capacitated Vehicle Routing Problem Attention Mechanism; Combinatorial Optimization; Heterogeneous CVRP; Pointer Network; Reinforcement Learning ACM Reference Format,” May 2024, doi: https://doi.org/10.5555/3635637.3662981.
[20] Z. Zong, X. Tong, M. Zheng, and Y. Li, “Reinforcement Learning for Solving Multiple Vehicle Routing Problem with Time Window,” ACM Trans Intell Syst Technol, vol. 15, no. 2, Mar. 2024, doi: https://doi.org/10.1145/3625232.
[21] E. Hendrawan and I. G. A. Widyadana, “Optimasi rute pengiriman dengan heterogeneous fleet vehicle routing problem with time windows,” Jurnal Sistem dan Manajemen Industri, vol. 2, no. 1, p. 1, May 2018, doi: https://doi.org/10.30656/jsmi.v2i1.518.
[22] R. Fauzi, A. Priansyah, P. K. Puspadewa, S. M. Z. Awal, H. T. Nguyen, and A. P. Rifai, “Optimizing vehicle routing for perishable products with time window constraints,” Jurnal Teknik Industri, vol. 27, no. 1, pp. 1–20, Jan. 2025, doi: https://doi.org/10.9744/jti.27.1.1-20.
[23] N. Huang, H. Qin, G. Xu, and F. Wan, “An enhanced exact algorithm for the multi-trip vehicle routing problem with time windows and capacitated unloading station,” 2024. doi: https://doi.org/10.1016/j.cor.2024.106688.
[24] E. N. Duman, D. Taş, and B. Çatay, “Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows,” Int J Prod Res, vol. 60, no. 17, pp. 5332–5353, 2022, doi: https://doi.org/10.1080/00207543.2021.1955995.
[25] N. A. El-Sherbeny, “Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods,” J King Saud Univ Sci, vol. 22, no. 3, pp. 123–131, 2010, doi: https://doi.org/10.1016/j.jksus.2010.03.002.
[26] I. N. Sutapa and I. G. A. Widyadana, “Studi Tentang Travelling Salesman dan Vehicle Routing Problem dengan Time Windows,” Jurnal Teknik Industri, vol. 5, no. 2, pp. 81–89, Dec. 2003, doi: https://doi.org/10.9744/jti.5.2.81-89.
[27] N. A. El-Sherbeny, “Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods,” J King Saud Univ Sci, vol. 22, no. 3, pp. 123–131, 2010, doi: https://doi.org/10.1016/j.jksus.2010.03.002.
[28] N. Azi, M. Gendreau, and J. Y. Potvin, “An exact algorithm for a single-vehicle routing problem with time windows and multiple routes,” Eur J Oper Res, vol. 178, no. 3, pp. 755–766, May 2007, doi: https://doi.org/10.1016/j.ejor.2006.02.019.
[29] R. Baldacci, A. Mingozzi, and R. Roberti, “Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints,” Eur J Oper Res, vol. 218, no. 1, pp. 1–6, Apr. 2012, doi: https://doi.org/10.1016/j.ejor.2011.07.037.
[30] I. James, Navigation and Nautical Astronomy: For the Use of British Seamen, 3rd ed. The Board of Longitude, 1835.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Heri Asbowo, Sirajuddin Sirajuddin, Muhammad Adha Ilhami
This work is licensed under a Creative Commons Attribution 4.0 International License.
Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).
This work is licensed under a Creative Commons Attribution License (CC BY).
