Pickup and Delivery Vehicle Routing Problem with Hybrid Missions and Third-Party Vehicle Rentals: A Case Study of Animal Feed Industry
DOI:
https://doi.org/10.55003/ETH.410304Keywords:
Vehicle routing problem, Pickup and delivery, Subcontract logistic, Mixed-integer linear programingAbstract
The vehicle routing problem for small and medium-sized animal feed manufacturers is a complex challenge because each transport route can vary significantly between delivering products to customers and picking up raw materials to return to the factory. Currently, businesses lack well-planned management for utilizing a limited number of trucks. As a result, they often incur additional costs by relying on third-party vehicle rentals. This research aims to reduce transportation costs for small and medium-sized animal feed manufacturers by solving a formulated mixed-integer linear programming (MILP) model, using experimental data that accurately reflects the actual problems faced. The MILP model results help reduce transportation costs by up to 18.5% compared to current practices by optimizing route sequences and incorporating the use of third-party vehicle rentals. This also serves as a guideline for reducing transportation costs in other similar industries.
References
S. Asgharieh Ahari, I. Bakir and K. J. Roodbergen, “A new perspective on carrier collaboration: Collaborative vehicle utilization,” Transportation Research Part C: Emerging Technologies, vol. 163, 2024, Art. no. 104647, doi: 10.1016/j.trc.2024.104647.
TTNews. “US Logistics Costs Rise 11.4% in 2018, Report Says.” ttnews.com. https://www.ttnews.com/articles/us-logistics-costs-rise-114-2018-report-says (accessed Nov. 09, 2022).
Cogoport. “The key element of logistics.” cogoport.com. https://www.cogoport.com/blogs/transport-cost (accessed Nov. 09, 2022).
NBCNews. “U.S. farmers feel the squeeze as Ukraine invasion sends livestock feed costs higher.” nbcnews.com https://www.nbcnews.com/news/us-news/us-farmers-feel-squeeze-ukraine-invasion-sends-livestock-feed-costs-hi-rcna20087 (accessed Nov. 09, 2022).
IFIF. “International Feed Industry Federation – The Global Feed Industry.” ifif.org. https://ifif.org/global-feed/industry/ (accessed Nov. 09, 2022).
F. Kocatürk, G. Y. Tütüncü and S. Salhi, “The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach,” Annals of Operations Research, vol. 307, pp. 277–302, 2021, doi: 10.1007/s10479-021-04137-6.
X. Zhu, Z. Zhao and R. Yan, “Low carbon logistics optimization for multi-depot cvrp with backhauls-model and solution,” Tehnički vjesnik, vol. 27, no. 5, pp. 1617–1624, 2020, doi: 10.17559/TV-20200809211109.
F. Stavropoulou, “The Consistent Vehicle Routing Problem with heterogeneous fleet,” Computers & Operations Research, vol. 140, 2022, Art. no. 105644, doi: 10.1016/j.cor.2021.105644.
D. Gasque and P. Munari, “Metaheuristic, models and software for the heterogeneous fleet pickup and delivery problem with split loads,” Journal of Computational Science, vol. 59, 2022, Art. no. 101549, doi: 10.1016/j.jocs.2021.101549.
D. Bustos-Coral and A. M. Costa, “Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations,” Transportation Research Part E: Logistics and Transportation Review, vol. 168, 2022, Art. no. 102922, doi: 10.1016/j.tre.2022.102922.
Z. Hussain Ahmed and M. Yousefikhoshbakht, “An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows,” Alexandria Engineering Journal, vol. 64, pp. 349–363, 2023, doi: 10.1016/j.aej.2022.09.008.
L. F. López-Castro, E. L. Solano-Charris and A. Pagès-Bernaus, “Environmental approach for the design of raw milk collection routes with a heterogeneous fleet,” Computers and Electronics in Agriculture, vol. 211, 2023, Art. no. 107995, doi: 10.1016/j.compag.2023.107995.
V. F. Yu, P. T. Anh, A. Gunawan and H. Han, “A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks,” Expert Systems with Applications, vol. 237, 2024, Art. no. 121631, doi: 10.1016/j.eswa.2023.121631.
M. J. Santos, D. Jorge, T. Ramos and A. Barbosa-Póvoa, “Green reverse logistics: Exploring the vehicle routing problem with deliveries and pickups,” Omega, vol. 118, 2023, Art. no. 102864, doi: 10.1016/j.omega.2023.102864.
J. Euchi, “The vehicle routing problem with private fleet and multiple common carriers: Solution with hybrid metaheuristic algorithm,” Vehicular Communications, vol. 9, pp. 97–108, 2017, doi: 10.1016/j.vehcom.2017.04.005.
J. Li, L. Jia, T. Li, X. Guan, H. Wang, D. Lu and H. Sun, “Scheduled service network design of long-haul freight transportation based on the segment subcontract,” Computers & Industrial Engineering, vol. 157, 2021, Art. no. 107253, doi: 10.1016/j.cie.2021.107253.
J. J. Alcaraz, L. Caballero-Arnaldos and J. Vales-Alonso, “Rich vehicle routing problem with last-mile outsourcing decisions,” Transportation Research Part E: Logistics and Transportation Review, vol. 129, pp. 263–286, 2019, doi: 10.1016/j.tre.2019.08.004.
Y. Dang, T. T. Allen and M. Singh, “A heterogeneous vehicle routing problem with common carriers and time regulations: Mathematical formulation and a two-color ant colony search,” Computers & Industrial Engineering, vol. 168, 2022, Art. no. 108036, doi: 10.1016/j.cie.2022.108036.
C. Gahm, C. Brabänder, and A. Tuma, “Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options,” Transportation Research Part E: Logistics and Transportation Review, vol. 97, pp. 192–216, 2017, doi: 10.1016/j.tre.2016.10.010.
F. M. Bergmann, S. M. Wagner and M. Winkenbach, “Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution,” Transportation Research Part B: Methodological, vol. 131, pp. 26–62, 2020, doi: 10.1016/j.trb.2019.09.013.
Y. Wang, Q. Li, X. Guan, J. Fan, M. Xu and H. Wang, “Collaborative multi-depot pickup and delivery vehicle routing problem with split loads and time windows,” Knowledge-Based Systems, vol. 231, 2021, Art. no. 107412, doi: 10.1016/j.knosys.2021.107412.
J. Zhao, H. Dong and N. Wang, “Green split multiple-commodity pickup and delivery vehicle routing problem,” Computers and Operations Research, vol. 159, 2023, Art. no. 106318, doi: 10.1016/j.cor.2023.106318.
N. Dubey and A. Tanksale, “A multi-depot vehicle routing problem with time windows, split pickup and split delivery for surplus food recovery and redistribution,” Expert Systems with Applications, vol. 232, 2023, Art. no. 120807, doi: 10.1016/j.eswa.2023.120807.
T. Ren, T. Luo, B. Jia, B. Yang, L. Wang and L. Xing, “Improved ant colony optimization for the vehicle routing problem with split pickup and split delivery,” Swarm and Evolutionary Computation, vol. 77, 2023, Art. no 101228, doi: 10.1016/j.swevo.2023.101228.
Y. Wang, L. Ran, X. Guan, J. Fan, Y. Sun and H. Wang, “Collaborative multicenter vehicle routing problem with time windows and mixed deliveries and pickups,” Expert Systems with Applications, vol. 197, 2022, Art. no. 116690, doi: 10.1016/j.eswa.2022.116690.
J. Sun and R. Wang, “Multi-objective optimization of a sustainable two echelon vehicle routing problem with simultaneous pickup and delivery in construction projects,” Journal of Engineering Research, 2023, doi: 10.1016/j.jer.2023.10.033.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 School of Engineering, King Mongkut’s Institute of Technology Ladkrabang
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The published articles are copyrighted by the School of Engineering, King Mongkut's Institute of Technology Ladkrabang.
The statements contained in each article in this academic journal are the personal opinions of each author and are not related to King Mongkut's Institute of Technology Ladkrabang and other faculty members in the institute.
Responsibility for all elements of each article belongs to each author; If there are any mistakes, each author is solely responsible for his own articles.
