IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v54y2020i2p302-312.html
   My bibliography  Save this article

Heuristic Sequence Selection for Inventory Routing Problem

Author

Listed:
  • Ahmed Kheiri

    (Department of Management Science, Lancaster University Management School, Lancaster LA1 4YX, United Kingdom)

Abstract

In this paper, an improved sequence-based selection hyper-heuristic method for the Air Liquide inventory routing problem, the subject of the ROADEF/EURO 2016 challenge, is described. The organizers of the challenge have proposed a real-world problem of inventory routing as a difficult combinatorial optimization problem. An exact method often fails to find a feasible solution to such problems. On the other hand, heuristics may be able to find a good quality solution that is significantly better than those produced by an expert human planner. There is a growing interest toward self-configuring automated general-purpose reusable heuristic approaches for combinatorial optimization. Hyper-heuristics have emerged as such methodologies. This paper investigates a new breed of hyper-heuristics based on the principles of sequence analysis to solve the inventory routing problem. The primary point of this work is that it shows the usefulness of the improved sequence-based selection hyper-heuristic, and in particular demonstrates the advantages of using a data science technique of hidden Markov model for the heuristic selection.

Suggested Citation

  • Ahmed Kheiri, 2020. "Heuristic Sequence Selection for Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 302-312, March.
    • Handle: RePEc:inm:ortrsc:v:54:y:2020:i:2:p:302-312
    DOI: 10.1287/trsc.2019.0934
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2019.0934
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2019.0934?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
    ---><---

    References listed on IDEAS

    as
    1. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2002. "The Stochastic Inventory Routing Problem with Direct Deliveries," Transportation Science, INFORMS, vol. 36(1), pages 94-118, February.
    2. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "A Decomposition Approach for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 38(4), pages 488-502, November.
    3. Christiansen, Marielle & Fagerholt, Kjetil & Flatberg, Truls & Haugen, Øyvind & Kloster, Oddvar & Lund, Erik H., 2011. "Maritime inventory routing with multiple products: A case study from the cement industry," European Journal of Operational Research, Elsevier, vol. 208(1), pages 86-94, January.
    4. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    5. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    6. Zhao, Qiu-Hong & Chen, Shuang & Zang, Cun-Xun, 2008. "Model and algorithm for inventory/routing decision in a three-echelon logistics system," European Journal of Operational Research, Elsevier, vol. 191(3), pages 623-635, December.
    7. Luca Bertazzi & Giuseppe Paletta & M. Grazia Speranza, 2002. "Deterministic Order-Up-To Level Policies in an Inventory Routing Problem," Transportation Science, INFORMS, vol. 36(1), pages 119-132, February.
    8. Ender Özcan & Mustafa Misir & Gabriela Ochoa & Edmund K. Burke, 2010. "A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 1(1), pages 39-59, January.
    9. Wilson, Dennis & Rodrigues, Silvio & Segura, Carlos & Loshchilov, Ilya & Hutter, Frank & Buenfil, Guillermo López & Kheiri, Ahmed & Keedwell, Ed & Ocampo-Pineda, Mario & Özcan, Ender & Peña, Sergio Iv, 2018. "Evolutionary computation for wind farm layout optimization," Renewable Energy, Elsevier, vol. 126(C), pages 681-691.
    10. Ahmed, Leena & Mumford, Christine & Kheiri, Ahmed, 2019. "Solving urban transit route design problem using selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 274(2), pages 545-559.
    11. Thierry Benoist & Frédéric Gardi & Antoine Jeanjean & Bertrand Estellon, 2011. "Randomized Local Search for Real-Life Inventory Routing," Transportation Science, INFORMS, vol. 45(3), pages 381-398, August.
    12. Kheiri, Ahmed & Özcan, Ender, 2016. "An iterated multi-stage selection hyper-heuristic," European Journal of Operational Research, Elsevier, vol. 250(1), pages 77-90.
    13. Raa, Birger & Aghezzaf, El-Houssaine, 2009. "A practical solution approach for the cyclic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 429-441, January.
    14. Boudia, M. & Prins, C., 2009. "A memetic algorithm with dynamic population management for an integrated production-distribution problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 703-715, June.
    15. Edmund K Burke & Michel Gendreau & Matthew Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & Rong Qu, 2013. "Hyper-heuristics: a survey of the state of the art," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1695-1724, December.
    16. T. William Chien & Anantaram Balakrishnan & Richard T. Wong, 1989. "An Integrated Inventory Allocation and Vehicle Routing Problem," Transportation Science, INFORMS, vol. 23(2), pages 67-76, May.
    17. 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.
    18. 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.
    19. Jonathan F. Bard & Liu Huang & Patrick Jaillet & Moshe Dror, 1998. "A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities," Transportation Science, INFORMS, vol. 32(2), pages 189-203, May.
    20. Stéphane Dauzère-Pérès & Atle Nordli & Asmund Olstad & Kjetil Haugen & Ulrich Koester & Myrstad Per Olav & Geir Teistklub & Alf Reistad, 2007. "Omya Hustadmarmor Optimizes Its Supply Chain for Delivering Calcium Carbonate Slurry to European Paper Manufacturers," Interfaces, INFORMS, vol. 37(1), pages 39-51, February.
    21. 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.
    22. S. Michel & F. Vanderbeck, 2012. "A Column-Generation Based Tactical Planning Method for Inventory Routing," Operations Research, INFORMS, vol. 60(2), pages 382-397, April.
    23. 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.
    24. Vishal Gaur & Marshall L. Fisher, 2004. "A Periodic Inventory Routing Problem at a Supermarket Chain," Operations Research, INFORMS, vol. 52(6), pages 813-822, December.
    25. Persson, Jan A. & Gothe-Lundgren, Maud, 2005. "Shipment planning at oil refineries using column generation and valid inequalities," European Journal of Operational Research, Elsevier, vol. 163(3), pages 631-652, June.
    26. 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. Swan, Jerry & Adriaensen, Steven & Brownlee, Alexander E.I. & Hammond, Kevin & Johnson, Colin G. & Kheiri, Ahmed & Krawiec, Faustyna & Merelo, J.J. & Minku, Leandro L. & Özcan, Ender & Pappa, Gisele L, 2022. "Metaheuristics “In the Large”," European Journal of Operational Research, Elsevier, vol. 297(2), pages 393-406.
    2. Saijun Shao & Kin Keung Lai & Biyun Ge, 2023. "A multi-period inventory routing problem with procurement decisions: a case in China," Annals of Operations Research, Springer, vol. 324(1), pages 1527-1555, May.
    3. 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.
    4. Liu, Aijun & Zhu, Qiuyun & Xu, Lei & Lu, Qiang & Fan, Youqing, 2021. "Sustainable supply chain management for perishable products in emerging markets: An integrated location-inventory-routing model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    5. Butterwick, Thomas & Kheiri, Ahmed & Lulli, Guglielmo & Gromicho, Joaquim & Kreeft, Jasper, 2023. "Application of selection hyper-heuristics to the simultaneous optimisation of turbines and cabling within an offshore windfarm," Renewable Energy, Elsevier, vol. 208(C), pages 1-16.
    6. Lagos, Felipe & Pereira, Jordi, 2024. "Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 70-91.
    7. Jean André & Eric Bourreau & Roberto Wolfler Calvo, 2020. "Introduction to the Special Section: ROADEF/EURO Challenge 2016—Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 299-301, March.
    8. 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.

    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. 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.
    2. 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.
    3. 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.
    4. Fokkema, Jan Eise & Land, Martin J. & Coelho, Leandro C. & Wortmann, Hans & Huitema, George B., 2020. "A continuous-time supply-driven inventory-constrained routing problem," Omega, Elsevier, vol. 92(C).
    5. 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.
    6. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
    7. 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.
    8. 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.
    9. 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.
    10. Mohd Kamarul Irwan Abdul Rahim & El-Houssaine Aghezzaf & Veronique Limère & Birger Raa, 2016. "Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(8), pages 1953-1965, June.
    11. Ali Ekici & Okan Örsan Özener & Gültekin Kuyzu, 2015. "Cyclic Delivery Schedules for an Inventory Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 817-829, November.
    12. 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.
    13. 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.
    14. Sonntag, Danja R. & Schrotenboer, Albert H. & Kiesmüller, Gudrun P., 2023. "Stochastic inventory routing with time-based shipment consolidation," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1186-1201.
    15. 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.
    16. 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.
    17. 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.
    18. S. Michel & F. Vanderbeck, 2012. "A Column-Generation Based Tactical Planning Method for Inventory Routing," Operations Research, INFORMS, vol. 60(2), pages 382-397, April.
    19. Jin-Hwa Song & Martin Savelsbergh, 2007. "Performance Measurement for Inventory Routing," Transportation Science, INFORMS, vol. 41(1), pages 44-54, February.
    20. 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.

    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:inm:ortrsc:v:54:y:2020:i:2:p:302-312. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.