IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v25y2025i1d10.1007_s12351-024-00885-y.html
   My bibliography  Save this article

Memetic algorithms and dynamic programming on vehicle routing problems in crisis situations

Author

Listed:
  • Stamatios Vasalakis

    (University of West Attica)

  • Athanasios Spyridakos

    (University of West Attica)

Abstract

The Vehicle Routing Problem is a broad field of study and practice. In this article, we will introduce a general methodology to solve a Dial-a-Ride problem as proposed by Jean-François Cordeau in 2006, followed by a briefly presentation on its further development by Zhang et al. (Omega 54: 60–71, 2015. https://doi.org/10.1016/j.omega.2015.01.011 ), which involved the use of memetic algorithms to tackle the problem of transportation services regarding the moving of people or goods between locations. Memetic Algorithms are a type of optimization algorithms that have an evolutionary framework and include a list of local search components. Specifically, this kind of problems categorized as a multi-trip dial-a-ride problem, which involves designing multiple routes for each mode of transportation. Finally, an extensive presentation is made based on the principles of Dynamical Programming, which discretizes the optimization problems in stages and the techniques of Linear Programming. The main objective is to utilize real-time information from electronic platforms to determine the most optimal transportation plan at each step. This type of problem is complex due to two main factors: (a) the urgent need to transport people based on their triage scale, and (b) the immediate movement towards the final destination. Additionally, other significant issues need to be taken into account, such as (a) the presence of multiple start and destination points for transportation with varying distances and availabilities, (b) the destination points of one stage becoming the start points for the next stage, (c) limited resources at destination points, and (d) the requirement to achieve global optimization of the response time concerning emergencies and priorities. A comparison will take place regarding these three methodological approaches (general Dial-a-Ride, memetic algorithm, dynamic programming), providing the benefits and the drawbacks of each one and illustrated through a case study involving the timely transport of people.

Suggested Citation

  • Stamatios Vasalakis & Athanasios Spyridakos, 2025. "Memetic algorithms and dynamic programming on vehicle routing problems in crisis situations," Operational Research, Springer, vol. 25(1), pages 1-28, March.
    • Handle: RePEc:spr:operea:v:25:y:2025:i:1:d:10.1007_s12351-024-00885-y
    DOI: 10.1007/s12351-024-00885-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00885-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-024-00885-y?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.

    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:operea:v:25:y:2025:i:1:d:10.1007_s12351-024-00885-y. 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.