IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v155y2014icp391-397.html
   My bibliography  Save this article

Improved solutions for inventory-routing problems through valid inequalities and input ordering

Author

Listed:
  • Coelho, Leandro C.
  • Laporte, Gilbert

Abstract

Inventory-routing problems (IRP) combine inventory control and vehicle routing, effectively optimizing inventory and replenishment decisions over several periods at a centralized level. In this paper we provide an exact formulation which includes several well-known valid inequalities for some classes of IRPs. We then propose three new valid inequalities based on the relation between demand and available capacities. Then, following an idea proposed for the binary clustering and for the job scheduling problems, we also show how the order of the input data can have a major effect on the linear relaxation of the proposed model for the IRP. Extensive computational experiments confirm the success of our algorithm. We have used two available datasets with new solutions identified as recently as 2013. On one set of benchmark instances with 249 open instances, we have improved 98 lower bounds, we have computed 96 new best known solutions, and we have proved optimality for 11 instances. On the other dataset composed of larger instances, of which were 63 open, we have improved 32 lower bounds, we have obtained 20 new best known solutions, and we proved optimality for three instances.

Suggested Citation

  • Coelho, Leandro C. & Laporte, Gilbert, 2014. "Improved solutions for inventory-routing problems through valid inequalities and input ordering," International Journal of Production Economics, Elsevier, vol. 155(C), pages 391-397.
    • Handle: RePEc:eee:proeco:v:155:y:2014:i:c:p:391-397
    DOI: 10.1016/j.ijpe.2013.11.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313005343
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2013.11.019?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. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    2. Gou, Qinglong & Liang, Liang & Huang, Zhimin & Xu, Chuanyong, 2008. "A joint inventory model for an open-loop reverse supply chain," International Journal of Production Economics, Elsevier, vol. 116(1), pages 28-42, November.
    3. 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.
    4. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    5. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    6. 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.
    7. van Donselaar, Karel H. & Broekmeulen, Rob A.C.M., 2013. "Determination of safety stocks in a lost sales inventory system with periodic review, positive lead-time, lot-sizing and a target fill rate," International Journal of Production Economics, Elsevier, vol. 143(2), pages 440-448.
    8. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    9. Van Horenbeek, Adriaan & Buré, Jasmine & Cattrysse, Dirk & Pintelon, Liliane & Vansteenwegen, Pieter, 2013. "Joint maintenance and inventory optimization systems: A review," International Journal of Production Economics, Elsevier, vol. 143(2), pages 499-508.
    10. Tarim, S. Armagan & Kingsman, Brian G., 2004. "The stochastic dynamic production/inventory lot-sizing problem with service-level constraints," International Journal of Production Economics, Elsevier, vol. 88(1), pages 105-119, March.
    11. Klibi, Walid & Martel, Alain, 2012. "Modeling approaches for the design of resilient supply networks under disruptions," International Journal of Production Economics, Elsevier, vol. 135(2), pages 882-898.
    12. Jack Rogers, 1958. "A Computational Approach to the Economic Lot Scheduling Problem," Management Science, INFORMS, vol. 4(3), pages 264-291, April.
    13. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    14. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    4. Janssen, Larissa & Diabat, Ali & Sauer, Jürgen & Herrmann, Frank, 2018. "A stochastic micro-periodic age-based inventory replenishment policy for perishable goods," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 445-465.
    5. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    6. 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.
    7. 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.
    8. 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.
    9. Zhouxing Su & Zhipeng Lü & Zhuo Wang & Yanmin Qi & Una Benlic, 2020. "A Matheuristic Algorithm for the Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 330-354, March.
    10. Paweł Hanczar, 2014. "Solving IRP using location based heuristics," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(2), pages 81-96.
    11. 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.
    12. Athanassios Nikolakopoulos & Ioannis Ganas, 2017. "Economic model predictive inventory routing and control," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 587-609, September.
    13. 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.
    14. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    15. Hadi Jahangir & Mohammad Mohammadi & Seyed Hamid Reza Pasandideh & Neda Zendehdel Nobari, 2019. "Comparing performance of genetic and discrete invasive weed optimization algorithms for solving the inventory routing problem with an incremental delivery," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2327-2353, August.
    16. Roel G. van Anholt & Leandro C. Coelho & Gilbert Laporte & Iris F. A. Vis, 2016. "An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines," Transportation Science, INFORMS, vol. 50(3), pages 1077-1091, August.
    17. 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.
    18. Bertazzi, Luca & Coelho, Leandro C. & De Maio, Annarita & Laganà, Demetrio, 2019. "A matheuristic algorithm for the multi-depot inventory routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 524-544.
    19. Yun He & Christian Artigues & Cyril Briand & Nicolas Jozefowiez & Sandra Ulrich Ngueveu, 2020. "A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 355-374, March.
    20. Ahmed Kheiri, 2020. "Heuristic Sequence Selection for Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 302-312, March.

    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:proeco:v:155:y:2014:i:c:p:391-397. 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/ijpe .

    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.