Streamlining multi-commodity inventory allocation and redistribution

References

• Alfieri, A., Marco, A. D., & Pastore, E. (2019). Last mile logistics in fast fashion supply chains: a case study. IFAC-PapersOnLine, 52(13), 1693–1698. 9th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2019. https://doi.org/10.1016/j.ifacol.2019.11.444
   Google Scholar
• Al Theeb, N., Smadi, H. J., Al-Hawari, T. H., & Aljarrah, M. H. (2020). Optimization of vehicle routing with inventory allocation problems in cold supply chain logistics. Computers & Industrial Engineering, 142, 106341. https://doi.org/10.1016/j.cie.2020.106341
   Web of Science ®Google Scholar
• Archetti, C., & Ljubić, I. (2022). Comparison of formulations for the inventory routing problem. European Journal of Operational Research, 303(3), 997–1008. https://doi.org/10.1016/j.ejor.2021.12.051
   Web of Science ®Google Scholar
• Bertazzi, L., & Speranza, M. G. (2012). Inventory routing problems: an introduction. EURO Journal on Transportation and Logistics, 1, 307–326. https://doi.org/10.1007/s13676-012-0016-7
   Google Scholar
• Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2014). Rich vehicle routing problem: survey. ACM Computing Surveys, 47(2), 1–28. https://doi.org/10.1145/2666003
   Web of Science ®Google Scholar
• Chagas, J. B. C., Silveira, U. E. F., Santos, A. G., & Souza, M. J. F. (2020). A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks. International Transactions in Operational Research, 27(1), 112–137. https://doi.org/10.1111/itor.v27.1
   Web of Science ®Google Scholar
• Chen, Q., Li, K., & Liu, Z. (2014). Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transportation Research Part E: Logistics and Transportation Review, 69, 218–235. https://doi.org/10.1016/j.tre.2014.06.010
   Web of Science ®Google Scholar
• De, S. K. (2023). The goat search algorithms. Artificial Intelligence Review, 56(8), 8265–8301. https://doi.org/10.1007/s10462-022-10341-y
   Web of Science ®Google Scholar
• Demantova, B. E., Scarpin, C. T., Coelho, L. C., & Darvish, M. (2021). An improved model and exact algorithm using local branching for the inventory-routing problem with time windows. International Journal of Production Research Online First, 61, 49–64. https://doi.org/10.1080/00207543.2021.1998696
   Web of Science ®Google Scholar
• Dethloff, J. (2001). Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, 23, 79–96. https://doi.org/10.1007/PL00013346
   Google Scholar
• Fahmy, S. A., & Gaafar, M. L. (2022). Modelling and solving the split-delivery vehicle routing problem, considering loading constraints and spoilage of commodities. International Journal of Systems Science: Operations & Logistics, 10(1). https://doi.org/10.1080/23302674.2022.2074566.
   Google Scholar
• Ghasemkhani, A., Tavakkoli-Moghaddam, R., Rahimi, Y., Shahnejat-Bushehri, S., & Tavakkoli-Moghaddam, H. (2022). Integrated production-inventory-routing problem for multi-perishable products under uncertainty by meta-heuristic algorithms. International Journal of Production Research, 60(9), 2766–2786. https://doi.org/10.1080/00207543.2021.1902013
   Web of Science ®Google Scholar
• Ghoseiri, K., & Ghannadpour, S. F. (2010). Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Applied Soft Computing, 10(4), 1096–1107. https://doi.org/10.1016/j.asoc.2010.04.001
   Web of Science ®Google Scholar
• Glover, F., Taillard, E., & Taillard, E. (1993). A user's guide to tabu search. Annals of Operations Research, 41, 3–28. https://doi.org/10.1007/BF02078647
   Google Scholar
• Gruler, A., Panadero, J., de Armas, J., Pérez, J. A. M., & Juan, A. A. (2020). A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands. International Transactions in Operational Research, 27(1), 314–335. https://doi.org/10.1111/itor.v27.1
   Web of Science ®Google Scholar
• Helsgaun, K. (2015). Solving the equality generalised traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm. Mathematical Programming Computation, 7, 269–287. https://doi.org/10.1007/s12532-015-0080-8
   Web of Science ®Google Scholar
• Hong, L. (2012). An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers & Operations Research, 39(2), 151–163. https://doi.org/10.1016/j.cor.2011.03.006
   Web of Science ®Google Scholar
• Konstantakopoulos, G. D., Gayialis, S. P., & Kechagias, E. P. (2022). Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Operational Research, 22(3), 2033–2062. https://doi.org/10.1007/s12351-020-00600-7
   Web of Science ®Google Scholar
• Li, C., Gong, L., Luo, Z., & Lim, A. (2019). A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing. Omega, 89, 71–91. https://doi.org/10.1016/j.omega.2018.09.014
   Web of Science ®Google Scholar
• Liu, A., Zhu, Q., Xu, L., Lu, Q., & Fan, Y. (2021). Sustainable supply chain management for perishable products in emerging markets: an integrated location-inventory-routing model. Transportation Research Part E: Logistics and Transportation Review, 150, 102319. https://doi.org/10.1016/j.tre.2021.102319
   Web of Science ®Google Scholar
• Liu, R., & Jiang, Z. (2019). A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints. Applied Soft Computing, 80, 18–30. https://doi.org/10.1016/j.asoc.2019.03.008
   Web of Science ®Google Scholar
• Liu, S., Tang, K., & Yao, X. (2021). Memetic search for vehicle routing with simultaneous pickup-delivery and time windows. Swarm and Evolutionary Computation, 66, 100927. https://doi.org/10.1016/j.swevo.2021.100927
   Web of Science ®Google Scholar
• Liu, W., Ke, G. Y., Chen, J., & Zhang, L. (2020). Scheduling the distribution of blood products: A vendor-managed inventory routing approach. Transportation Research Part E: Logistics and Transportation Review, 140, 101964. https://doi.org/10.1016/j.tre.2020.101964
   Web of Science ®Google Scholar
• Mahmutogulları, Ö, & Yaman, H. (2023). A branch-and-cut algorithm for the inventory routing problem with product substitution. Omega, 115, 102752. https://doi.org/10.1016/j.omega.2022.102752
   Web of Science ®Google Scholar
• Malicki, S., & Minner, S. (2021). Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands. Computers & Operations Research, 131, 105247. https://doi.org/10.1016/j.cor.2021.105247
   Web of Science ®Google Scholar
• Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100. https://doi.org/10.1016/S0305-0548(97)00031-2
   Web of Science ®Google Scholar
• Mor, A., & Speranza, M. G. (2020). Vehicle routing problems over time: a survey. 4OR, 18, 129–149. https://doi.org/10.1007/s10288-020-00433-2
   Google Scholar
• Moradi, B. (2020). The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model. Soft Computing, 24, 6741–6769. https://doi.org/10.1007/s00500-019-04312-9
   Web of Science ®Google Scholar
• Naderi, S., Kilic, K., & Dasci, A. (2020). A deterministic model for the transshipment problem of a fast fashion retailer under capacity constraints. International Journal of Production Economics, 227, 107687. https://doi.org/10.1016/j.ijpe.2020.107687
   Web of Science ®Google Scholar
• Neves-Moreira, F., Almada-Lobo, B., Guimarães, L., & Amorim, P. (2022). The multi-product inventory-routing problem with pickups and deliveries: mitigating fluctuating demand via rolling horizon heuristics. Transportation Research Part E: Logistics and Transportation Review, 164, 102791. https://doi.org/10.1016/j.tre.2022.102791
   Web of Science ®Google Scholar
• Öztaş, T., & Tuş, A. (2022). A hybrid metaheuristic algorithm based on iterated local search for vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 202, 117401. https://doi.org/10.1016/j.eswa.2022.117401
   Web of Science ®Google Scholar
• Pinto, T., Alves, C., & Valério de Carvalho, J. (2020). Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. International Transactions in Operational Research, 27(1), 549–572. https://doi.org/10.1111/itor.v27.1
   Web of Science ®Google Scholar
• Ren, X., Huang, H., Feng, S., & Liang, G. (2020). An improved variable neighborhood search for bi-objective mixed-energy fleet vehicle routing problem. Journal of Cleaner Production, 275, 124155. https://doi.org/10.1016/j.jclepro.2020.124155
   Web of Science ®Google Scholar
• Sánchez-Oro, J., López-Sánchez, A. D., & Colmenar, J. M. (2020). A general variable neighborhood search for solving the multi-objective open vehicle routing problem. Journal of Heuristics, 26, 423–452. https://doi.org/10.1007/s10732-017-9363-8
   Web of Science ®Google Scholar
• Shen, Y., Liu, M., Yang, J., Shi, Y., & Middendorf, M. (2020). A hybrid swarm intelligence algorithm for vehicle routing problem with time windows. IEEE Access, 8, 93882–93893. https://doi.org/10.1109/Access.6287639
   Google Scholar
• Sherif, S. U., Asokan, P., Sasikumar, P., Mathiyazhagan, K., & Jerald, J. (2021). Integrated optimization of transportation, inventory and vehicle routing with simultaneous pickup and delivery in two-echelon green supply chain network. Journal of Cleaner Production, 287, 125434. https://doi.org/10.1016/j.jclepro.2020.125434
   Web of Science ®Google Scholar
• Shi, Y., Zhou, Y., Boudouh, T., & Grunder, O. (2020). A lexicographic-based two-stage algorithm for vehicle routing problem with simultaneous pickup-delivery and time window. Engineering Applications of Artificial Intelligence, 95, 103901. https://doi.org/10.1016/j.engappai.2020.103901
   Web of Science ®Google Scholar
• Taguchi, G., Chowdhury, S., & Taguchi, S. (2000). Robust engineering. McGraw-Hill Education.
   Google Scholar
• Tanksale, A., & Jha, J. (2017). Solving multi-region multi-facility inventory allocation and transportation problem: A case of Indian public distribution system. Computers & Industrial Engineering, 110, 175–190. https://doi.org/10.1016/j.cie.2017.05.037
   Web of Science ®Google Scholar
• Xu, D., Li, K., Zou, X., & Liu, L. (2017). An unpaired pickup and delivery vehicle routing problem with multi-visit. Transportation Research Part E: Logistics and Transportation Review, 103, 218–247. https://doi.org/10.1016/j.tre.2017.04.011
   Web of Science ®Google Scholar
• Yavari, M., Enjavi, H., & Geraeli, M. (2020). Demand management to cope with routes disruptions in location-inventory-routing problem for perishable products. Research in Transportation Business & Management, 37, 100552. https://doi.org/10.1016/j.rtbm.2020.100552
   PubMed Web of Science ®Google Scholar
• Yu, V. F., Widjaja, A. T., Gunawan, A., & Vansteenwegen, P. (2021). The multi-vehicle cyclic inventory routing problem: formulation and a metaheuristic approach. Computers & Industrial Engineering, 157, 107320. https://doi.org/10.1016/j.cie.2021.107320
   Web of Science ®Google Scholar
• Zhang, D., Cai, S., Ye, F., Si, Y. W.., & Nguyen, T. T. (2017). A hybrid algorithm for a vehicle routing problem with realistic constraints. Information Sciences, 394-395, 167–182. https://doi.org/10.1016/j.ins.2017.02.028
   Web of Science ®Google Scholar
• Zhang, J., Yang, F., & Weng, X. (2018). An evolutionary scatter search particle swarm optimization algorithm for the vehicle routing problem with time windows. IEEE Access, 6, 63468–63485. https://doi.org/10.1109/ACCESS.2018.2877767
   Google Scholar
• Zhang, Z., Cheang, B., Li, C., & Lim, A. (2019). Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. Computers & Operations Research, 103, 81–96. https://doi.org/10.1016/j.cor.2018.10.020
   Web of Science ®Google Scholar