IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i1p26-38.html
   My bibliography  Save this article

Mechanisms for feasibility and improvement for inventory-routing problems

Author

Listed:
  • Thiago A. Guimarães
  • Cleder M. Schenekemberg
  • Leandro C. Coelho
  • Cassius T. Scarpin
  • José E. Pécora

Abstract

Inventory-routing problems (IRPs) define a class of combinatorial optimization problems, encompassing inventory management and vehicle routing decisions into the same framework. In this article, we propose a new modular mechanism capable of recovering feasibility and improving even partial solutions by reorganizing delivery routes and optimizing inventory flows. It can be embedded into different optimization algorithms, either heuristic or exact ones. We exploit the use of this mechanism to improve a traditional branch-and-cut scheme and evaluate it by solving the multi-vehicle IRP (MIRP) and the multi-depot IRP (MDIRP). The results show that our method is very effective; outperforming other approaches on well-known benchmark instances from the literature. Regarding the MIRP, our algorithm obtains 417 optimal solutions for 638 small instances, the best result among all exact algorithms, with nine new ones. On a large data set, our method finds all optimal solutions for instances with up to 50 customers for the single-vehicle, besides providing 90% of new best-known solutions (BKS) for 100 customers. On the MDIRP, our approach finds 27 new optimal solutions and 73% of new BKS, improving previous BKS by more than 7% on average.

Suggested Citation

  • Thiago A. Guimarães & Cleder M. Schenekemberg & Leandro C. Coelho & Cassius T. Scarpin & José E. Pécora, 2024. "Mechanisms for feasibility and improvement for inventory-routing problems," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(1), pages 26-38, January.
  • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:1:p:26-38
    DOI: 10.1080/01605682.2023.2174052
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2174052
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2023.2174052?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:75:y:2024:i:1:p:26-38. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.