IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v127y2024ics0305048324000495.html
   My bibliography  Save this article

Robust inventory routing problem under uncertain demand and risk-averse criterion

Author

Listed:
  • Feng, Yuqiang
  • Che, Ada
  • Tian, Na

Abstract

Inventory routing problem (IRP), which plays an important role in implementing vendor-managed-inventory strategy, is to determine the optimal timing and quantity of products to be delivered as well as the optimal vehicle delivery routes from the vendor to retailers. Retailers’ demand is usually uncertain and their distributions are ambiguous. We utilize limited historical demand data of retailers to construct a series of scenarios to characterize demand uncertainties. Moreover, we develop a framework to construct ambiguity sets and describe the ambiguities in demand distributions. To cater to the new feature of IRP as being exposed to downside risk and balance the mean and risk level of cost, we incorporate the worst-case mean-conditional value-at-risk (M-CVaR) criterion into the objective function and present a new distributionally robust IRP model. We transform the proposed model into a tractable formulation based on duality theory. A case study demonstrates the feasibility of the proposed method. The results indicate that our model can provide a robust delivery solution for immunizing against the influence of ambiguous demand distributions. In addition, an out-of-sample performance analysis shows that the delivery solution provided by our model can effectively reduce the product shortage rate.

Suggested Citation

  • Feng, Yuqiang & Che, Ada & Tian, Na, 2024. "Robust inventory routing problem under uncertain demand and risk-averse criterion," Omega, Elsevier, vol. 127(C).
  • Handle: RePEc:eee:jomega:v:127:y:2024:i:c:s0305048324000495
    DOI: 10.1016/j.omega.2024.103082
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324000495
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.omega.2024.103082?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. Seyed Mohammad Gholami-Zanjani & Sobhgol Gholipour & Masoud Rabbani, 2019. "An integrated approach for robust inventory routing problem in a three-echelon distribution system," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 32(3/4), pages 414-436.
    3. Lars Magnus Hvattum & Arne Løkketangen & Gilbert Laporte, 2009. "Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 268-285, May.
    4. Shang, Xiaoting & Zhang, Guoqing & Jia, Bin & Almanaseer, Mohammed, 2022. "The healthcare supply location-inventory-routing problem: A robust approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    5. Wang, Weiqiao & Yang, Kai & Yang, Lixing & Gao, Ziyou, 2023. "Distributionally robust chance-constrained programming for multi-period emergency resource allocation and vehicle routing in disaster response operations," Omega, Elsevier, vol. 120(C).
    6. Niakan, Farzad & Rahimi, Mohammad, 2015. "A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 80(C), pages 74-94.
    7. Albert Y. Ha & Huajiang Luo & Weixin Shang, 2022. "Supplier Encroachment, Information Sharing, and Channel Structure in Online Retail Platforms," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1235-1251, March.
    8. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    9. Jun Ru & Ruixia Shi & Jun Zhang, 2018. "When Does A Supply Chain Member Benefit from Vendor†Managed Inventory?," Production and Operations Management, Production and Operations Management Society, vol. 27(5), pages 807-821, May.
    10. Sehgal, Ruchika & Sharma, Amita & Mansini, Renata, 2023. "Worst-case analysis of Omega-VaR ratio optimization model," Omega, Elsevier, vol. 114(C).
    11. Liu, Ming & Liu, Xin & Chu, Feng & Zheng, Feifeng & Chu, Chengbin, 2019. "Distributionally robust inventory routing problem to maximize the service level under limited budget," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 190-211.
    12. Yu, Yugang & Chu, Feng & Chen, Haoxun, 2009. "A Stackelberg game and its improvement in a VMI system with a manufacturing vendor," European Journal of Operational Research, Elsevier, vol. 192(3), pages 929-948, February.
    13. Micheli, Guido J.L. & Mantella, Fabio, 2018. "Modelling an environmentally-extended inventory routing problem with demand uncertainty and a heterogeneous fleet under carbon control policies," International Journal of Production Economics, Elsevier, vol. 204(C), pages 316-327.
    14. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    15. Ahmad Ghasemkhani & Reza Tavakkoli-Moghaddam & Yaser Rahimi & Sina Shahnejat-Bushehri & Haed Tavakkoli-Moghaddam, 2022. "Integrated production-inventory-routing problem for multi-perishable products under uncertainty by meta-heuristic algorithms," International Journal of Production Research, Taylor & Francis Journals, vol. 60(9), pages 2766-2786, May.
    16. John M. Mulvey & Andrzej Ruszczyński, 1995. "A New Scenario Decomposition Method for Large-Scale Stochastic Optimization," Operations Research, INFORMS, vol. 43(3), pages 477-490, June.
    17. Li, Runjie & Cui, Zheng & Kuo, Yong-Hong & Zhang, Lianmin, 2023. "Scenario-based Distributionally Robust Optimization for the Stochastic Inventory Routing Problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    18. Rahimi, Mohammad & Baboli, Armand & Rekik, Yacine, 2017. "Multi-objective inventory routing problem: A stochastic model to consider profit, service level and green criteria," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 59-83.
    19. Soysal, Mehmet & Bloemhof-Ruwaard, Jacqueline M. & Haijema, Rene & van der Vorst, Jack G.A.J., 2015. "Modeling an Inventory Routing Problem for perishable products with environmental considerations and demand uncertainty," International Journal of Production Economics, Elsevier, vol. 164(C), pages 118-133.
    20. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    21. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    22. Shushang Zhu & Masao Fukushima, 2009. "Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management," Operations Research, INFORMS, vol. 57(5), pages 1155-1168, October.
    23. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    24. Mohammad Rahimi & Armand Baboli & Yacine Rekik, 2017. "Multi-objective inventory routing problem : A stochastic model to consider profit, service level and green criteria," Post-Print hal-02311993, HAL.
    25. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2021. "Inventory routing under stochastic supply and demand," Omega, Elsevier, vol. 102(C).
    26. Yugang Yu & Chengbin Chu & Haoxun Chen & Feng Chu, 2012. "Large scale stochastic inventory routing problems with split delivery and service level constraints," Annals of Operations Research, Springer, vol. 197(1), pages 135-158, August.
    27. Walter J. Bell & Louis M. Dalberto & Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Pradeep Kedia & Robert G. Mack & Paul J. Prutzman, 1983. "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, INFORMS, vol. 13(6), pages 4-23, December.
    28. Huang, Shan-Huen & Lin, Pei-Chun, 2010. "A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 598-611, September.
    29. Weskamp, Christoph & Koberstein, Achim & Schwartz, Frank & Suhl, Leena & Voß, Stefan, 2019. "A two-stage stochastic programming approach for identifying optimal postponement strategies in supply chains with uncertain demand," Omega, Elsevier, vol. 83(C), pages 123-138.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kim, Yun Geon & Chung, Byung Do, 2024. "Data-driven Wasserstein distributionally robust dual-sourcing inventory model under uncertain demand," Omega, Elsevier, vol. 127(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Ming & Liu, Xin & Chu, Feng & Zheng, Feifeng & Chu, Chengbin, 2019. "Distributionally robust inventory routing problem to maximize the service level under limited budget," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 190-211.
    2. Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
    3. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    4. A. Mor & M. G. Speranza, 2022. "Vehicle routing problems over time: a survey," Annals of Operations Research, Springer, vol. 314(1), pages 255-275, July.
    5. Mirzapour Al-e-hashem, Seyed M.J. & Rekik, Yacine & Mohammadi Hoseinhajlou, Ebrahim, 2019. "A hybrid L-shaped method to solve a bi-objective stochastic transshipment-enabled inventory routing problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 381-398.
    6. Rossi, Roberto & Tomasella, Maurizio & Martin-Barragan, Belen & Embley, Tim & Walsh, Christopher & Langston, Matthew, 2019. "The Dynamic Bowser Routing Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 108-126.
    7. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    8. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    9. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    10. Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2021. "Inventory routing under stochastic supply and demand," Omega, Elsevier, vol. 102(C).
    11. Mosca, Alyssa & Vidyarthi, Navneet & Satir, Ahmet, 2019. "Integrated transportation – inventory models: A review," Operations Research Perspectives, Elsevier, vol. 6(C).
    12. Micheli, Guido J.L. & Mantella, Fabio, 2018. "Modelling an environmentally-extended inventory routing problem with demand uncertainty and a heterogeneous fleet under carbon control policies," International Journal of Production Economics, Elsevier, vol. 204(C), pages 316-327.
    13. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2016. "Min–Max exact and heuristic policies for a two-echelon supply chain with inventory and transportation procurement decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 57-70.
    14. Ji, Ying & Du, Jianhui & Han, Xiaoya & Wu, Xiaoqing & Huang, Ripeng & Wang, Shilei & Liu, Zhimin, 2020. "A mixed integer robust programming model for two-echelon inventory routing problem of perishable products," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 548(C).
    15. Jafarian, Ahmad & Asgari, Nasrin & Mohri, Seyed Sina & Fatemi-Sadr, Elham & Farahani, Reza Zanjirani, 2019. "The inventory-routing problem subject to vehicle failure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 254-294.
    16. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem, 2021. "Green vehicle routing problem: A state-of-the-art review," Post-Print hal-03182944, HAL.
    17. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution," Omega, Elsevier, vol. 115(C).
    18. Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
    19. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.
    20. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:127:y:2024:i:c:s0305048324000495. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.