IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v283y2020i2p511-529.html
   My bibliography  Save this article

Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products

Author

Listed:
  • Alvarez, Aldair
  • Cordeau, Jean-François
  • Jans, Raf
  • Munari, Pedro
  • Morabito, Reinaldo

Abstract

In this paper, we study an inventory routing problem in which goods are perishable. In this problem, a single supplier is responsible for delivering a perishable product to a set of customers during a given finite planning horizon. The product is assumed to have a fixed shelf-life during which it is usable and after which it must be discarded. We introduce four mathematical formulations for the problem, two with a vehicle index and two without a vehicle index, and propose branch-and-cut algorithms to solve them. In addition, we propose a hybrid heuristic based on the combination of an iterated local search metaheuristic and two mathematical programming components. We present the results of extensive computational experiments using instances from the literature as well as new larger instances. The results show the different advantages of the introduced formulations and show that the hybrid method is able to provide high-quality solutions in relatively short running times for small- and medium-sized instances while good quality solutions are found within reasonable running times for larger instances. We also adapted the proposed hybrid heuristic to solve the basic variant of the inventory routing problem. The results using standard instances show that our heuristic is also able to find good quality solutions for this problem when compared to the state-of-the-art methods from the literature.

Suggested Citation

  • Alvarez, Aldair & Cordeau, Jean-François & Jans, Raf & Munari, Pedro & Morabito, Reinaldo, 2020. "Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products," European Journal of Operational Research, Elsevier, vol. 283(2), pages 511-529.
    • Handle: RePEc:eee:ejores:v:283:y:2020:i:2:p:511-529
    DOI: 10.1016/j.ejor.2019.11.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719309269
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.11.015?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. Yves Crama & Mahmood Rezaei & Martin Savelsbergh & Tom Van Woensel, 2018. "Stochastic Inventory Routing for Perishable Products," Transportation Science, INFORMS, vol. 52(3), pages 526-546, June.
    2. Ali Diabat & Tarek Abdallah & Tung Le, 2016. "A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods," Annals of Operations Research, Springer, vol. 242(2), pages 373-398, July.
    3. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A hybrid recourse policy for the vehicle routing problem with stochastic demands," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 269-298, September.
    4. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2019. "Optimal production, replenishment, delivery, routing and inventory management policies for products with perishable inventory," Omega, Elsevier, vol. 82(C), pages 193-204.
    5. Awi Federgruen & Gregory Prastacos & Paul H. Zipkin, 1986. "An Allocation and Distribution Model for Perishable Products," Operations Research, INFORMS, vol. 34(1), pages 75-82, February.
    6. Claudia Archetti & Natashia Boland & Grazia Speranza, 2017. "A Matheuristic for the Multivehicle Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 377-387, August.
    7. Guy Desaulniers & Jørgen G. Rakke & Leandro C. Coelho, 2016. "A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 50(3), pages 1060-1076, August.
    8. Chen, Zhixiang, 2018. "Optimization of production inventory with pricing and promotion effort for a single-vendor multi-buyer system of perishable products," International Journal of Production Economics, Elsevier, vol. 203(C), pages 333-349.
    9. Salavati-Khoshghalb, Majid & Gendreau, Michel & Jabali, Ola & Rei, Walter, 2019. "An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy," European Journal of Operational Research, Elsevier, vol. 273(1), pages 175-189.
    10. Dillon, Mary & Oliveira, Fabricio & Abbasi, Babak, 2017. "A two-stage stochastic programming model for inventory management in the blood supply chain," International Journal of Production Economics, Elsevier, vol. 187(C), pages 27-41.
    11. 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.
    12. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Cordeau, Jean-François & Guimarães, Luís & Jans, Raf, 2019. "Solving a large multi-product production-routing problem with delivery time windows," Omega, Elsevier, vol. 86(C), pages 154-172.
    13. Yu, Min & Nagurney, Anna, 2013. "Competitive food supply chain networks with application to fresh produce," European Journal of Operational Research, Elsevier, vol. 224(2), pages 273-282.
    14. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 103-120, February.
    15. Claudia Archetti & Luca Bertazzi & Alain Hertz & M. Grazia Speranza, 2012. "A Hybrid Heuristic for an Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 101-116, February.
    16. Masoud Chitsaz & Jean-François Cordeau & Raf Jans, 2019. "A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 134-152, February.
    17. Subramanian, Anand & Penna, Puca Huachi Vaz & Uchoa, Eduardo & Ochi, Luiz Satoru, 2012. "A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 221(2), pages 285-295.
    18. Claudia Archetti & Luca Bertazzi & Gilbert Laporte & Maria Grazia Speranza, 2007. "A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem," Transportation Science, INFORMS, vol. 41(3), pages 382-391, August.
    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. 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).
    2. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    3. Zelin Wang & Xiaoning Wei & Jiansheng Pan, 2021. "Research on IRP of Perishable Products Based on Mobile Data Sharing Environment," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 15(2), pages 139-157, April.
    4. Hanukov, Gabi, 2022. "Improving efficiency of service systems by performing a part of the service without the customer's presence," European Journal of Operational Research, Elsevier, vol. 302(2), pages 606-620.
    5. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    6. Zelin Wang & Xiaoning Wei & Jiansheng Pan, 2021. "Research on IRP of Perishable Products Based on Mobile Data Sharing Environment," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 15(2), pages 5-23, April.
    7. Esmaeili, Somayeh & Bashiri, Mahdi & Amiri, Amirhossein, 2023. "An exact criterion space search algorithm for a bi-objective blood collection problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 210-232.

    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. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    2. 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).
    3. Diabat, Ali & Bianchessi, Nicola & Archetti, Claudia, 2024. "On the zero-inventory-ordering policy in the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1024-1038.
    4. 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.
    5. Archetti, Claudia & Ljubić, Ivana, 2022. "Comparison of formulations for the Inventory Routing Problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 997-1008.
    6. Skålnes, Jørgen & Ben Ahmed, Mohamed & Hvattum, Lars Magnus & Stålhane, Magnus, 2024. "New benchmark instances for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 313(3), pages 992-1014.
    7. Skålnes, Jørgen & Andersson, Henrik & Desaulniers, Guy & Stålhane, Magnus, 2022. "An improved formulation for the inventory routing problem with time-varying demands," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1189-1201.
    8. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    9. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    10. Ziye Tang & Yang Jiao & R. Ravi, 2022. "Combinatorial Heuristics for Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 370-384, January.
    11. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    12. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    13. Avci, Mustafa & Yildiz, Seyda Topaloglu, 2019. "A matheuristic solution approach for the production routing problem with visit spacing policy," European Journal of Operational Research, Elsevier, vol. 279(2), pages 572-588.
    14. 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.
    15. Claudia Archetti & Natashia Boland & Grazia Speranza, 2017. "A Matheuristic for the Multivehicle Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 377-387, August.
    16. Li, Yantong & Chu, Feng & Côté, Jean-François & Coelho, Leandro C. & Chu, Chengbin, 2020. "The multi-plant perishable food production routing with packaging consideration," International Journal of Production Economics, Elsevier, vol. 221(C).
    17. Archetti, Claudia & Coelho, Leandro C. & Grazia Speranza, M., 2019. "An exact algorithm for the inventory routing problem with logistic ratio," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 96-107.
    18. Schenekemberg, Cleder M. & Scarpin, Cassius T. & Pécora, José E. & Guimarães, Thiago A. & Coelho, Leandro C., 2021. "The two-echelon production-routing problem," European Journal of Operational Research, Elsevier, vol. 288(2), pages 436-449.
    19. Darvish, Maryam & Archetti, Claudia & Coelho, Leandro C., 2019. "Trade-offs between environmental and economic performance in production and inventory-routing problems," International Journal of Production Economics, Elsevier, vol. 217(C), pages 269-280.
    20. Coelho, Leandro Callegari & De Maio, Annarita & Laganà, Demetrio, 2020. "A variable MIP neighborhood descent for the multi-attribute inventory routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).

    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:ejores:v:283:y:2020:i:2:p:511-529. 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/locate/eor .

    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.