Publication Cover
Transportation Letters
The International Journal of Transportation Research
Volume 13, 2021 - Issue 2
345
Views
4
CrossRef citations to date
0
Altmetric
Article

An integrated (1, T) inventory policy and vehicle routing problem under uncertainty: an accelerated Benders decomposition algorithm

References

  • Arab, R., S. F. Ghaderi, and R. Tavakkoli-Moghaddam. 2018. “Bi-objective Inventory Routing Problem with Backhauls under Transportation Risks: Two Meta-heuristics.” Transportation Letters 1–17. doi:10.1080/19427867.2018.1533624.
  • Ballou, R. H. 1992. Business Logistics Management. 3rd ed. Englewood Cliffs: Prentice-Hall.
  • Benders, J. F. J. N. M. 1962. “Partitioning Procedures for Solving Mixed-variables Programming Problems.” Numerische Mathematik 4 (1): 238–252. doi:10.1007/BF01386316.
  • Bertazzi, L., L. C. Coelho, A. De Maio, and D. Laganà. 2019. “A Matheuristic Algorithm for the Multi-depot Inventory Routing Problem.” Transportation Research Part E: Logistics and Transportation Review 122: 524–544. doi:10.1016/j.tre.2019.01.005.
  • Bijvank, M., and I. F. Vis. 2011. “Lost-sales Inventory Theory: A Review.” European Journal of Operational Research 215 (1): 1–13. doi:10.1016/j.ejor.2011.02.004.
  • Chen, F., Z. Drezner, J. K. Ryan, and D. Simchi-Levi. 2000. “Quantifying the Bullwhip Effect in a Simple Supply Chain: The Impact of Forecasting, Lead Times, and Information.” Management Science 46 (3): 436–443. doi:10.1287/mnsc.46.3.436.12069.
  • Erfani, B., S. Ebrahimnejad, and A. Moosavi. 2019. “An Integrated Dynamic Facility Layout and Job Shop Scheduling Problem: A Hybrid NSGA-II and Local Search Algorithm.” Journal of Industrial & Management Optimization 1317–1336. doi:10.3934/jimo.2019030.
  • Fischetti, M., and A. J. M. P. Lodi. 2003. “Local Branching.” Mathematical Programming 98 (1): 23–47. doi:10.1007/s10107-003-0395-5.
  • Geoffrion, A. M., and G. W. Graves. 1974. “Multicommodity Distribution System Design by Benders Decomposition.” Management Science 20 (5): 822–844. doi:10.1287/mnsc.20.5.822.
  • Golpîra, H., E. Najafi, M. Zandieh, and S. Sadi-Nezhad. 2017. “Robust Bi-level Optimization for Green Opportunistic Supply Chain Network Design Problem against Uncertainty and Environmental Risk.” Computers & Industrial Engineering 107: 301–312. doi:10.1016/j.cie.2017.03.029.
  • Gruen, T. W., D. S. Corsten, and S. Bharadwaj. 2002. Retail Out-of-stocks: A Worldwide Examination of Extent, Causes and Consumer Responses. Washington, DC: Grocery Manufacturers of America.
  • Guimarães, T. A., L. C. Coelho, C. M. Schenekemberg, and C. T. Scarpin. 2019. “The Two-echelon Multi-depot Inventory-routing Problem.” Computers & Operations Research 111: 220–233. doi:10.1016/j.cor.2018.07.024.
  • Haji, R., and A. R. Haji. 2007. “One-for-one Period Policy and Its Optimal Solution.” Journal of Industrial and Systems Engineering 1 (3): 200–217.
  • Haji, R., M. P. Neghab, and A. Baboli. 2009. “Introducing a New Ordering Policy in a Two-echelon Inventory System with Poisson Demand.” International Journal of Production Economics 117 (1): 212–218. doi:10.1016/j.ijpe.2008.10.007.
  • Hamming, R. W. 1950. “Error Detecting and Error Correcting Codes.” Bell Labs Technical Journal 29 (2): 147–160. doi:10.1002/j.1538-7305.1950.tb00463.x.
  • Hillier, F. S. 2012. Introduction to Operations Research. Tata McGraw-Hill Education.
  • Jahangir, H., M. Mohammadi, S. H. R. Pasandideh, and N. Z. Nobari. 2018. “Comparing Performance of Genetic and Discrete Invasive Weed Optimization Algorithms for Solving the Inventory Routing Problem with an Incremental Delivery.” Journal of Intelligent Manufacturing 1–27. doi:10.1007/s10845-018-1393-z.
  • Jakubicek, P., and C. Woudsma. 2011. “Proximity, Land, Labor and Planning? Logistics Industry Perspectives on Facility Location.” Transportation Letters 3 (3): 161–173. doi:10.3328/TL.2011.03.03.161-173.
  • Javid, A. A., and N. Azad. 2010. “Incorporating Location, Routing and Inventory Decisions in Supply Chain Network Design.” Transportation Research Part E: Logistics and Transportation Review 46 (5): 582–597. doi:10.1016/j.tre.2009.06.005.
  • Kara, I., G. Laporte, and T. Bektas. 2004. “A Note on the Lifted Miller–Tucker–Zemlin Subtour Elimination Constraints for the Capacitated Vehicle Routing Problem.” European Journal of Operational Research 158 (3): 793–795. doi:10.1016/S0377-2217(03)00377-1.
  • Kayvanfar, V., S. M. Husseini, M. S. Sajadieh, and B. Karimi. 2018. “A Multi-echelon Multi-product Stochastic Model to Supply Chain of Small-and-medium Enterprises in Industrial Clusters.” Computers & Industrial Engineering 115: 69–79. doi:10.1016/j.cie.2017.11.003.
  • Lee, H. L., V. Padmanabhan, and S. Whang. 1997. “The Bullwhip Effect in Supply Chains.” Sloan Management Review 38: 93–102.
  • Lefever, W., E. H. Aghezzaf, K. Hadj-Hamou, and B. Penz. 2018. “Analysis of an Improved Branch-and-Cut Formulation for the Inventory-routing Problem with Transshipment.” Computers & Operations Research 98: 137–148. doi:10.1016/j.cor.2018.05.023.
  • Lenstra, J. K., and A. R. Kan. 1981. “Complexity of Vehicle Routing and Scheduling Problems.” Networks 11 (2): 221–227. doi:10.1002/net.3230110211.
  • Metters, R. 1997. “Quantifying the Bullwhip Effect in Supply Chains.” Journal of Operations Management 15 (2): 89–100. doi:10.1016/S0272-6963(96)00098-8.
  • Micheli, G. J., and F. Mantella. 2018. “Modelling an Environmentally-extended Inventory Routing Problem with Demand Uncertainty and a Heterogeneous Fleet under Carbon Control Policies.” International Journal of Production Economics 204: 316–327. doi:10.1016/j.ijpe.2018.08.018.
  • Minner, S. 2003. “Multiple-supplier Inventory Models in Supply Chain Management: A Review.” International Journal of Production Economics 81: 265–279. doi:10.1016/S0925-5273(02)00288-8.
  • Moosavi, A., and A. Nikfarjam. 2019. “A Multi-path Routing-inventory Problem for A Closed-loop Supply Chain considering the Heterogeneous Fleet of Vehicles.” International Journal of Sustainable Engineering. doi:10.1080/19397038.2019.1566412.
  • Peres, I. T., H. M. Repolho, R. Martinelli, and N. J. Monteiro. 2017. “Optimization in Inventory-routing Problem with Planned Transshipment: A Case Study in the Retail Industry.” International Journal of Production Economics 193: 748–756. doi:10.1016/j.ijpe.2017.09.002.
  • Perona, M., and G. Miragliotta. 2004. “Complexity Management and Supply Chain Performance Assessment. A Field Study and A Conceptual Framework.” International Journal of Production Economics 90 (1): 103–115. doi:10.1016/S0925-5273(02)00482-6.
  • Prins, C., C. Prodhon, and R. W. Calvo. 2006. “Solving the Capacitated Location-routing Problem by a GRASP Complemented by a Learning Process and a Path Relinking.” 4OR 4 (3): 221–238. doi:10.1007/s10288-006-0001-9.
  • Qiu, Y., J. Qiao, and P. M. Pardalos. 2019. “Optimal Production, Replenishment, Delivery, Routing and Inventory Management Policies for Products with Perishable Inventory.” Omega 82: 193–204. doi:10.1016/j.omega.2018.01.006.
  • Rahmaniani, R., T. G. Crainic, M. Gendreau, and W. Rei. 2017. “The Benders Decomposition Algorithm: A Literature Review.” European Journal of Operational Research 259 (3): 801–817. doi:10.1016/j.ejor.2016.12.005.
  • Rao, U. S. 2003. “Properties of the Periodic Review (R,T) Inventory Control Policy for Stationary, Stochastic Demand.” Manufacturing & Service Operations Management 5 (1): 37–53. doi:10.1287/msom.5.1.37.12761.
  • Rei, W., J.-F. Cordeau, M. Gendreau, and P. Soriano. 2009. “Accelerating Benders Decomposition by Local Branching.” INFORMS Journal on Computing 21 (2): 333–345. doi:10.1287/ijoc.1080.0296.
  • Render, B., and J. Heizer. 1997. Principles of Operations Management. Prentice Hall.
  • Rezaee, A., F. Dehghanian, B. Fahimnia, and B. Beamon. 2017. “Green Supply Chain Network Design with Stochastic Demand and Carbon Price.” Annals of Operations Research 250 (2): 463–485. doi:10.1007/s10479-015-1936-z.
  • Rezaei, N., S. Ebrahimnejad, A. Moosavi, and A. Nikfarjam. 2019. “A Green Vehicle Routing Problem with Time Windows considering the Heterogeneous Fleet of Vehicles: Two Metaheuristic Algorithms.” European Journal of Industrial Engineering 13 (4): 507–535. doi:10.1504/EJIE.2019.100919.
  • Saif-Eddine, A. S., M. M. El-Beheiry, and A. K. El-Kharbotly. In Press. “Optimizing Total Supply Chain Cost in Inventory Location Routing Problem Using Developed Hybrid Genetic Algorithm.” Ain Shams Engineering Journal. 10.1016/j.asej.2018.09.002.
  • Tayebi, H., R. Haji, and B. G. Jeddi. 2018. “Joint Order (1, T) Policy for a Two-echelon, Single-item, Multi-retailer Inventory System with Poisson Demand.” Computers & Industrial Engineering 119: 353–359. doi:10.1016/j.cie.2018.04.009.
  • Yadollahi, E., E. H. Aghezzaf, J. Walraevens, B. Raa, and D. Claeys. 2019. “Evaluating Approximate Solution Models for the Stochastic Periodic Inventory Routing Problem.” Journal of Manufacturing Systems 50: 25–35. doi:10.1016/j.jmsy.2018.11.001.
  • Zakharov, V. V., and V. A. Shirokikh. 2018. “Heuristic Evaluation of the Characteristic Function in the Cooperative Inventory Routing Game.” Journal on Vehicle Routing Algorithms 1 (1): 19–32. doi:10.1007/s41604-017-0003-0.
  • Zhalechian, M., R. Tavakkoli-Moghaddam, B. Zahiri, and M. Mohammadi. 2016. “Sustainable Design of a Closed-loop Location-routing-inventory Supply Chain Network under Mixed Uncertainty.” Transportation Research Part E: Logistics and Transportation Review 89: 182–214. doi:10.1016/j.tre.2016.02.011.
  • Zheng, X., M. Yin, and Y. Zhang. 2019. “Integrated Optimization of Location, Inventory and Routing in Supply Chain Network Design.” Transportation Research Part B: Methodological 121: 1–20. doi:10.1016/j.trb.2019.01.003.
  • Zipkin, P. 2008. “Old and New Methods for Lost-sales Inventory Systems.” Operations Research 56 (5): 1256–1263. doi:10.1287/opre.1070.0471.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.