Dual-Sourcing Inventory Routing Problem with Route-Dependent Lead Times in Rolling Horizon Framework
Source abstract
Abstract
Traditional inventory routing problems ignore the time consumption in transportation. In this paper, an inventory routing problem with air–land transportation and route-dependent lead times is studied. The model is based on the rolling horizon framework which can serve as a “here-and-now” approximation for multi-period inventory routing problems. A planning horizon crossing strategy is proposed to consider the effect of the single-period decision on long-term planning. The box uncertainty set is used to depict demands. A tractable closed-form robust solution for optimal replenishment quantity is derived. An adaptive variable neighborhood search algorithm is developed for this problem. A novel shaking phase is proposed, and the performance of shaking operators is evaluated in numerical experiments. Results also validate the effectiveness of the robust solution and the planning horizon crossing strategy.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Vehicle Routing Optimization Methods · Optimization and Mathematical Programming · Facility Location and Emergency Management
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Economics and Management, Beihang University, 37 Xueyuan Road, Beijing 100191, China
Beijing Key Laboratory of Emergency Support Simulation Technologies for City Operations, 37 Xueyuan Road, Beijing 100191, China
Funding
National Natural Science Foundation of China
References (45)
Show source-provided references
1. A modelling framework to forecast urban goods flows10.1016/j.retrec.2020.100827 ↗
2. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer10.1287/inte.13.6.4 ↗
3. Vendor-managed inventory in the retail supply chain
4. A computational comparison of algorithms for the inventory routing problem10.1007/BF02022035 ↗
5. Humanitarian relief supplies distribution: An application of inventory routing problem10.1007/s10479-018-2781-7 ↗
6. Inventory routing problems: A logistical overview10.1057/palgrave.jors.2602264 ↗
7. Thirty years of inventory routing10.1287/trsc.2013.0472 ↗
8. A literature review of the perishable inventory routing problem10.1016/j.ajsl.2022.05.002 ↗
9. Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network10.1007/s10479-017-2514-3 ↗
10. Imran, M., Habib, M.S., Hussain, A., Ahmed, N., and Al-Ahmari, A.M. (2020). Inventory routing problem in supply chain of perishable products under cost uncertainty. Mathematics, 8.10.3390/math8030382 ↗
11. Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products10.1016/j.ejor.2019.11.015 ↗
12. The minimum latency in location routing fuzzy inventory problem for perishable multi-product materials10.1016/j.asoc.2021.107543 ↗
13. A single period deterministic inventory routing model for solving problems in the agriculture industry
14. An inventory routing policy under replenishment lead time10.1109/TSMC.2016.2562561 ↗
15. Inventory/routing: Reduction from an annual to a short-period problem10.1002/1520-6750(198712)34:6<891::AID-NAV3220340613>3.0.CO;2-J ↗
16. The exact solution of several classes of inventory-routing problems10.1016/j.cor.2012.08.012 ↗
17. A combined vehicle routing and inventory allocation problem10.1287/opre.32.5.1019 ↗
18. Delivery cost approximations for inventory routing problems in a rolling horizon framework10.1287/trsc.36.3.292.7829 ↗
19. Inventory routing and dynamic redistribution of relief goods in post-disaster operations10.1016/j.cie.2019.106219 ↗
20. Multi-modal transport of perishable products with demand uncertainty and empty repositioning: A scenario-based rolling horizon framework10.1016/j.ejtl.2021.100044 ↗
21. A branch-and-cut algorithm for a vendor-managed inventory-routing problem10.1287/trsc.1060.0188 ↗
22. Scenario tree-based heuristics for stochastic inventory-routing problems10.1287/ijoc.1080.0291 ↗
23. A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty10.1016/j.tre.2010.01.006 ↗
24. Inventory routing under stochastic supply and demand10.1016/j.omega.2020.102304 ↗
25. Convex programming with set-inclusive constraints and applications to inexact linear programming10.1287/opre.21.5.1154 ↗
26. Closed-form solutions for robust inventory management10.1287/mnsc.2015.2391 ↗
27. Approximation algorithms for stochastic inventory control models10.1287/moor.1060.0205 ↗
28. A 2-approximation algorithm for stochastic inventory control models with lost sales10.1287/moor.1070.0285 ↗
29. Robust dual sourcing inventory management: Optimality of capped dual index policies and smoothing10.1287/msom.2018.0731 ↗
30. A periodic review inventory system with emergency replenishments10.1287/mnsc.47.3.415.9770 ↗
31. Freight vehicle routing with reliable link travel times: A method based on network fundamental diagram10.1080/19427867.2016.1241040 ↗
32. Estimating path choice models through floating car data10.3390/forecast4020029 ↗
33. Croce, A.I., Musolino, G., Rindone, C., and Vitetta, A. (2022). Traffic and Energy Consumption Modelling of Electric Vehicles: Parameter Updating from Floating and Probe Vehicle Data. Energies, 15.10.3390/en15010082 ↗
34. Russo, F., and Rindone, C. (2021). Regional transport plans: From direction role denied to common rules identified. Sustainability, 13.10.3390/su13169052 ↗
35. Programming model of emergency scheduling with combined air–ground transportation10.1177/1687814017739512 ↗
36. An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones10.1016/j.trc.2019.02.018 ↗
37. Zheng, W., and Zhou, H. (2018, January 22–23). Routing problem with multiple transportation modes considering road damage. Proceedings of the 2018 International Conference on Computer Modeling, Simulation and Algorithm (CMSA 2018), Beijing, China.10.2991/cmsa-18.2018.57 ↗
38. A modified adaptive genetic algorithm for multi-product multi-period inventory routing problem10.1016/j.susoc.2021.08.002 ↗
39. Zheng, W., and Zhou, H. (2019, January 15–18). Robust inventory routing problem with replenishment lead time. Proceedings of the 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Macao, China.10.1109/IEEM44572.2019.8978718 ↗
40. The inventory-routing problem with transshipment10.1016/j.cor.2011.12.020 ↗
41. A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem10.1016/j.ejor.2015.10.053 ↗
42. Multi-product multi-period Inventory Routing Problem with a transshipment option: A green approach10.1016/j.ijpe.2013.09.005 ↗
43. A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation10.1016/j.compchemeng.2011.01.005 ↗
44. Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries10.1016/j.ejor.2021.04.027 ↗
45. A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing10.1016/j.omega.2018.09.014 ↗