Ant colony optimization to solve the rescue problem as a vehicle routing problem with hard time windows
Loading...
Author (Corporation)
Publication date
2022
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editor (Corporation)
Supervisor
Parent work
Proceedings of international joint conference on advances in computational intelligence. Algorithms for intelligent systems
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
53-65
Patent number
Publisher / Publishing institution
Springer
Place of publication / Event location
Singapore
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
The rescue problem is an adaptation of a standard Vehicle Routing Problem where a set of patients suffering from various medical conditions has to be picked up by a set of ambulances and brought back to the hospital. Optimizing this problem is important to improve the use of life emergency vehicles in daily or disaster situations. Although this problem is usually modeled as a Capacitated Vehicle Routing Problem, different formulations are proposed in the literature including multi-objective optimization with shortest route and maximization of the number of patients that will survive or remain stable. Ant Colony Optimization (ACO) and Genetic Algorithms (GA) are frequently used, where ACO performs better on objectives specific to the rescue problem. We model the problem as a single-objective Vehicle Routing Problem with Time Windows (VRPTW) using hard time windows. Each patient is assigned a degree of injury and a corresponding maximum time window. An immediate return to the hospital for critically injured patients is also introduced. The rescue problem turns to a VRPTW with hard time windows for different problem sizes and is solved with ACO. The results suggest that with a sufficiently large fleet, it can be ensured that critically injured patients are reached in good time.
Keywords
Subject (DDC)
Event
5th International Joint Conference on Advances in Computational Intelligence (IJCACI 2021)
Exhibition start date
Exhibition end date
Conference start date
23.10.2021
Conference end date
24.10.2021
Date of the last check
ISBN
978-981-19-0331-1
978-981-19-0332-8
978-981-19-0332-8
ISSN
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Published
Review
Peer review of the complete publication
Open access category
Closed
License
Citation
Suppan, M., Hanne, T., & Dornberger, R. (2022). Ant colony optimization to solve the rescue problem as a vehicle routing problem with hard time windows. In M. S. Uddin, P. K. Jamwal, & J. C. Bansal (Eds.), Proceedings of international joint conference on advances in computational intelligence. Algorithms for intelligent systems (pp. 53–65). Springer. https://doi.org/10.1007/978-981-19-0332-8_5