Heterogeneous Fleet Vehicle Routing Problem dan Penyelesaiannya Menggunakan Metode Nearest Neighbor : Kasus Pendistribusian Ayam Potong

Article Sidebar

PDF
Published: Aug 7, 2026
DOI: https://doi.org/10.12962/limits.v23i2.8956
Keywords:
fleet, heterogeneous, vehicle routing problem,, route, nearest neighbor

Main Article Content

Evi Yuliza
Universitas Sriwijaya
Novi Rustiana Dewi
Universitas Sriwijaya
Sisca Octarina
Universitas Sriwijaya
Indrawati Indrawati
Universitas Sriwijaya

Abstract

Distribution of goods using a heterogeneous fleet of vehicles is an important aspect in a logistics system because it affects distribution efficiency. This study aims to determine the optimal distribution route for broiler chickens using the Heterogeneous Fleet Vehicle Routing Problem (HFVRP) model to minimize the total vehicle mileage. The data used include customer locations, number of requests, vehicle capacity, heterogeneous vehicle types, and distances between locations. The problem is modeled in HFVRP by considering vehicle capacity, each customer is visited exactly once, and vehicles depart and return to the depot. The solution is carried out using the Nearest Neighbor method to generate distribution routes and compared with the optimal solution from the HFVRP model. The results show a total mileage of 88.6 km for the Nearest Neighbor method, while the optimal solution from the HFVRP model produces a total mileage of 121.2 km. Based on these results, the Nearest Neighbor method provides a more efficient route solution in the case of broiler chicken distribution.

Article Details

How to Cite
Yuliza, E., Dewi, N. R., Octarina, S., & Indrawati, I. (2026). Heterogeneous Fleet Vehicle Routing Problem dan Penyelesaiannya Menggunakan Metode Nearest Neighbor : Kasus Pendistribusian Ayam Potong. Limits: Journal of Mathematics and Its Applications, 23(2), 311–323. https://doi.org/10.12962/limits.v23i2.8956
Issue
Vol. 23 No. 2 (2026): Limits: Journal of Mathematics and Its Applications Volume 23 Nomor 2 Edisi Juli 2026
Section
Articles

References

[1] Z. H. Ahmed and M. Yousefikhoshbakht, “A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows,” Symmetry (Basel)., vol. 15, no. 2, pp. 1–18, 2023, doi: 10.3390/sym15020486.

[2] G. D. Konstantakopoulos, S. P. Gayialis, and E. P. Kechagias, “Vehicle Routing Problem and Related Algorithms for Logistics distribution: A Literature Review and Classification,” Oper. Res., vol. 22, no. 3, pp. 2033–2062, 2022, doi: 10.1007/s12351-020-00600-7.

[3] M. N. Kritikos and G. Ioannou, “The Heterogeneous Fleet Vehicle Routing Problem with Overloads and Time Windows,” Int. J. Prod. Econ., vol. 144, no. 1, pp. 68–75, 2013, doi: 10.1016/j.ijpe.2013.01.020.

[4] Y. Meliani, Y. Hani, S. L. Elhaq, and A. El Mhamedi, “A developed Tabu Search Algorithm for Heterogeneous Fleet Vehicle Routing Problem,” IFAC-PapersOnLine, vol. 52, no. 13, pp. 1051–1056, 2019, doi: 10.1016/j.ifacol.2019.11.334.

[5] N. M. E. Normasari and N. Lathifah, “Heterogeneous Fleet Green Vehicle Routing Problem: A Literature Review,” Angkasa J. Ilm. Bid. Teknol., vol. 13, no. 1, pp. 49–57, 2021, doi: 10.28989/angkasa.v13i1.837.

[6] A. Moutaoukil, G. Neubert, and R. Derrouiche, “A Comparison of Homogeneous and Heterogeneous Vehicle Fleet Size in Green Vehicle Routing Problem,” IFIP Adv. Inf. Commun. Technol., vol. 439, no. PART 2, pp. 450–457, 2014, doi: 10.1007/978-3-662-44736-9_55.

[7] S. M. Nugroho, L. Nafisah, M. S. A. Khannan, H. Mastrisiswadi, and M. N. Ramdhani, “Vehicle Routing Problem with Heterogeneous Fleet, Split Delivery, Multiple Product, Multiple Trip, and Time Windows: A Case study in fuel distribution,” IOP Conf. Ser. Mater. Sci. Eng., vol. 847, no. 1, 2020, doi: 10.1088/1757-899X/847/1/012066.

[8] A. L. S. Souza, M. Bernardo, P. H. V. Penna, J. Pannek, and M. J. F. Souza, “Bi-objective optimization Model for the heterogeneous Dynamic dial-a-ride problem with no Rejects,” Optim. Lett., vol. 16, no. 1, pp. 355–374, 2022, doi: 10.1007/s11590-020-01698-6.

[9] V. V. Panicker and M. Ihsan O, “Solving a Heterogeneous Fleet Vehicle Routing Model-A practical approach,” Int. Conf. Syst. Comput. Autom. Networking, ICSCA, pp. 1–5, 2018, doi: 10.1109/ICSCAN.2018.8541149.

[10] W. Qin, Z. Zhuang, Z. Huang, and H. Huang, “A Novel Reinforcement Learning Based-Hyper-heuristic for Heterogeneous Vehicle Routing Problem,” Comput. Ind. Eng., vol. 156, no. March, p. 107252, 2021, doi: 10.1016/j.cie.2021.107252.

[11] C. Singhtaun and H. Piyapornthana, “Mathematical Model and Solution Approach for a Heterogeneous Fleet Open Vehicle Routing Problem,” Int. J. GEOMATE, vol. 22, no. 90, pp. 17–23, 2022, doi: 10.21660/2022.90.7673.

[12] V. F. Yu, P. Jewpanya, A. A. N. P. Redi, and Y. C. Tsao, “Adaptive Neighborhood Simulated Annealing For the Heterogeneous Fleet Vehicle Routing Problem with Multiple Cross-docks,” Comput. Oper. Res., vol. 129, p. 105205, 2021, doi: 10.1016/j.cor.2020.105205.

[13] Y. Yu, S. Wang, J. Wang, and M. Huang, “A Branch-and-Price algorithm for the Heterogeneous Fleet Green Vehicle Routing Problem with Time Windows,” Transp. Res. Part B Methodol., vol. 122, pp. 511–527, 2019, doi: 10.1016/j.trb.2019.03.009.

[14] W. C. Yeh and S. Y. Tan, “Simplified Swarm Optimization for the Heterogeneous Fleet Vehicle Routing Problem with Time-Varying Continuous Speed Function,” Electron., vol. 10, no. 15, 2021.

[15] S. Onut, M. R. Kamber, and G. Altay, “A Heterogeneous Fleet vehicle Routing Model for Solving the LPG Distribution Problem: A Case Study,” J. Phys. Conf. Ser., vol. 490, no. 1, 2014, doi: 10.1088/1742-6596/490/1/012043.

[16] E. Yuliza, F. M. Puspita, S. Yahdin, and R. Emiliya, “Solving Capacitated Vehicle Routing Problem Using of Clarke and Wright Algorithm and LINGO in LPG distribution,” J. Phys. Conf. Ser., vol. 1663, p. 012027, 2020, doi: 10.1088/1742-6596/1663/1/012027.

[17] N. A. Fitriani, R. A. Pratama, S. Zahro, P. H. Utomo, and T. S. Martini, “Solving Capacitated Vehicle Routing Problem Using Saving Matrix, Sequential Insertion, and Nearest Neighbor of Product ‘X’ in Grobogan District,” AIP Conf. Proc., vol. 2326, 2021, doi: 10.1063/5.0039295.

[18] R. F. Harahap and Sawaluddin, “Study Vehicle Routing Problem Using Nearest Neighbor Algorithm,” J. Phys. Conf. Ser., vol. 2421, no. 1, 2023, doi: 10.1088/1742-6596/2421/1/012027.

[19] E. E. Rosyida and I. B. Efendi, “Capacitated Vehicle Routing Problem ( CVRP ) with Sweep and Nearest Neighbor Algorithm,” Sinergi Int. J. Logist., vol. 2, no. 1, pp. 17–29, 2024.

[20] E. Yuliza, B. Suprihatin, P. B. Jaya Bangun, F. M. Puspita, S. Octarina, and Nuraina, “Saving Matrix Method and Nearest Neighbor Method for Garbage Transport Route Problems,” AIP Conf. Proc., vol. 3046, no. 1, 2024, doi: 10.1063/5.0194590.

[21] D. G. Rossit, A. A. Toncovich, and M. Fermani, “Routing in waste collection: A simulated annealing algorithm for an Argentinean case study,” Math. Biosci. Eng., vol. 18, no. 6, pp. 9579–9605, 2021, doi: 10.3934/mbe.2021470.