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

Stamatios Vasalakis () and Athanasios Spyridakos
Additional contact information
Stamatios Vasalakis: University of West Attica
Athanasios Spyridakos: University of West Attica

Operational Research, 2025, vol. 25, issue 1, No 8, 28 pages

Abstract: 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.

Keywords: Memetic algorithm; Linear programming; Dynamical programming; Transportation; Australasian triage scale (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12351-024-00885-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:25:y:2025:i:1:d:10.1007_s12351-024-00885-y

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-024-00885-y

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().