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

Introduction to the Special Section: ROADEF/EURO Challenge 2016—Inventory Routing Problem

Author

Listed:
  • Jean André

    (Computational and Data Science Research and Development Laboratory, Air Liquide, 75321 Paris Cedex 07, France;)

  • Eric Bourreau

    (Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, Université Montpellier, 34090 Montpellier, France;)

  • Roberto Wolfler Calvo

    (Institut Galilée, Université Paris 13, 93430 Villetaneuse, France)

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:54:y:2020:i:2:p:299-301
    DOI: 10.1287/trsc.2019.0972
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2019.0972
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2019.0972?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. Christian Artigues & Eric Bourreau & H. Murat Afsar & Olivier Briant & Mourad Boudia, 2012. "Disruption management for commercial airlines: methods and results for the ROADEF 2009 Challenge," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(6), pages 669-689.
    2. Ahmed Kheiri, 2020. "Heuristic Sequence Selection for Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 302-312, March.
    3. 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.
    4. H. Murat Afsar & Christian Artigues & Eric Bourreau & Safia Kedad-Sidhoum, 2016. "Machine reassignment problem: the ROADEF/EURO challenge 2012," Annals of Operations Research, Springer, vol. 242(1), pages 1-17, July.
    5. 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.
    6. Nabil Absi & Diego Cattaruzza & Dominique Feillet & Maxime Ogier & Frédéric Semet, 2020. "A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing," Transportation Science, INFORMS, vol. 54(2), pages 313-329, March.
    7. Christian Artigues & Eric Bourreau & Vincent Jost & Safia Kedad-Sidhoum & François Ramond, 2018. "Trains do not vanish: the ROADEF/EURO challenge 2014," Annals of Operations Research, Springer, vol. 271(2), pages 1091-1105, December.
    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. 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.
    2. 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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. Wang, Guanglei & Ben-Ameur, Walid & Ouorou, Adam, 2019. "A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines," European Journal of Operational Research, Elsevier, vol. 276(1), pages 28-39.
    6. 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.
    7. Zhang, Dong & Yu, Chuhang & Desai, Jitamitra & Lau, H.Y.K. Henry, 2016. "A math-heuristic algorithm for the integrated air service recovery," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 211-236.
    8. H. Murat Afsar & Christian Artigues & Eric Bourreau & Safia Kedad-Sidhoum, 2016. "Machine reassignment problem: the ROADEF/EURO challenge 2012," Annals of Operations Research, Springer, vol. 242(1), pages 1-17, July.
    9. 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.

    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:inm:ortrsc:v:54:y:2020:i:2:p:299-301. 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.