IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-92575-7_41.html
   My bibliography  Save this book chapter

Combining Heuristics, Simulation, and Machine Learning for Solving Routing Problems

Author

Listed:
  • Mohammad Peyman

    (Universitat Politècnica de València)

  • Xabier A. Martin

    (Universitat Politècnica de València)

  • Javier Panadero

    (Universitat Autònoma de Barcelona)

  • Angel A. Juan

    (Universitat Politècnica de València)

Abstract

In this work, we present a sim-learnheuristic approach to solving the Multi-Source Team Orienteering Problem (MS-TOP) under stochastic and dynamic conditions. By combining deterministic, stochastic, and dynamic components, our methodology is able to efficiently address this complex variant of the MS-TOP. Specifically, we conduct a case study using real-world data from electric bicycle stations in Barcelona, gathered from Open Data Barcelona. The study involves efficiently distributing bicycles to various stations starting from different hubs, and finishing at a central depot. This task becomes significantly more complex with the inclusion of stochastic travel times and dynamically changing factors such as weather or traffic congestion. Our approach is able to find high-quality solutions in short computational times by combining heuristic algorithms, simulation, and machine learning components. The case study demonstrates the practical applicability and effectiveness of our method in a real-world context.

Suggested Citation

  • Mohammad Peyman & Xabier A. Martin & Javier Panadero & Angel A. Juan, 2025. "Combining Heuristics, Simulation, and Machine Learning for Solving Routing Problems," Lecture Notes in Operations Research,, Springer.
  • Handle: RePEc:spr:lnopch:978-3-031-92575-7_41
    DOI: 10.1007/978-3-031-92575-7_41
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:lnopch:978-3-031-92575-7_41. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.