Journal of Transportation Research

Journal of Transportation Research

Multi-depot routing feeder of truck and motorcycle

Document Type : Original Article

Authors
Homeyra Kord 1
Javad Behnamian 2
1 Ph.D., Candidate, Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran.
2 Professor, Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran.
10.22034/tri.2025.479235.3278
Abstract
Nowadays, due to the increasing trend of population and the development of cities, followed by the increase in the supply and demand of services, transportation and related issues have become very important. Therefore, in this study, the problem of multi-depot feeder vehicle routing is investigated in the case where several trucks cooperate with several motorcycles. The multi-depot feeder vehicle routing problem consists of multiple depot with a heterogeneous fleet of vehicles including trucks and motorcycles, which motorcycles can move in crowded and high-traffic areas. In addition to the fact that the feeder approach reduces the number of times of returning to the depot and reduces the time and cost of transportation, the increase in the number of depots also causes more customers to be covered and the travel distance, cost, and time are reduced. Here, a mixed integer programming model has been developed in order to investigate the effect of increasing the number of depot in providing quick and low-cost service to customers. The results showed that the cost and time of the solution increases with the increase of the dimensions of the problem.
Keywords
Multi-fleet
Multi-depot feeder vehicle routing
Mathematical modeling
Subjects
-صالحی سربیژن، مرتضی و بهنامیان، جواد (1401). الگوریتم آزادسازی لاگرانژ برای حل مسئله مسیریابی وسیلۀ نقلیه تغدیه‌کنندۀ چندناوگانی. نشریه پژوهش­های مهندسی صنایع در سیستم­های تولید. 10(21)، 19-33.
- بهنامیان، جواد (1397). مقدمه­ای بر بهینه­سازی ترکیباتی. انتشارات دانشگاه بوعلی سینا.
- بهنامیان، جواد (1395). حل مسائل بهینه­سازی پیچیده روش­ها و الگوریتم­ها، انتشارات دانشگاه بوعلی سینا.
- حاجی خانی، مصطفی و بهنامیان، جواد (1400). مسئله مسیریابی وسایل نقلیه چند انباره با تحویل چندمرحله‌ای و محدودیت تردد: الگوریتم جستجوی همسایگی متغیر. پژوهش­های نوین در تصمیم­گیری، 6(1)، 64-44.
-­Brandstätter, C., (2019). A metaheuristic algorithm and structured analysis for the Line-haul Feeder Vehicle Routing Problem with Time Windows. Central European Journal of Operations Research, 1-43.
-Chang, J., Y.J. Cho, and Y.C. Hwang. (2001). A study on time constrained vehicle routing problem for lunch box delivery. in Proceedings of the Annual Meeting of Chinese Institute of Industrial Engineering. Kaohsiung, Taiwan­.
-Chen, H.K., et al.,  (2011). The linehaul-feeder vehicle routing problem with virtual depots. IEEE Transactions on Automation Science and Engineering, 8(4): 694-­704­.
‏-Figliozzi, M. A. (2007). Planning approximations to the length of TSP and VRP problem. ‏ stochastic optimization. Massachusetts Institute of Technology.
-Friggstad, Z., Mousavi, R., Rahgoshay, M., & Salavatipour, M. R. (2021). Improved approximations for CVRP with unsplittable demands. arXiv preprint arXiv:2111.08138.‏
-Garey, M.R., and Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco.
-Huang, Y. H., et al., (2019). Solving the Feeder Vehicle Routing Problem using ant colony optimization. Computers & Industrial Engineering, 127: 520-535.
  -Laporte, G. (1992). The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(2), 231-247.
-Laporte, G. (1992). The vehicle routing problem:An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3), 345-358.
-Rahmaniani, R., Crainic, T. G., Gendreau, M., & Rei, W. (2017). The Benders decomposition algorithm:A literature review. European Journal of Operational Research, 259(3), 801-817.‏
-Salehi Sarbijan, M. and J. Behnamian, (2022).Multi-fleet feeder vehicle routing problem using hybrid metaheuristic. Computers & Operations Research, 141:  105696-10597.
-Salehi Sarbijan, M. and J. Behnamian, (2022).Real-time collaborative feeder vehicle routing problem with flexible time windows. Swarm and Evolutionary Computation, 75: 101201-101202.
-Wan, F., Guo, H., Pan, W., Hou, J., & Chen, S. (2023). A mathematical method for solving multi-depot vehicle routing problem. Soft Computing, 27(21), 15699-15717.
- Tu, s., S. Lai, and Y. Li, (2001). Application of the vehicle routing problem with time windows—an example of lunch box delivery. Graduation Term Paper, Department of Transportation Technology and Logistics Management, Chung Hua University,
Hsin Chu, Taiwan.
-Yousefikhoshbakht, M., Chaharmahali, M., & Ahmed, Z. H. (2023). The Line-Haul Feeder Vehicle Routing Problem: A Classification and Review. Complexity.
-Yu, B., Yang, Z. Z., & Xie, J. X. (2011). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society, 62(1), 183-188.‏