Abstract

The vehicle routing problem is a well-researched problem with various solutions. Although this problem has been solved many times, there is rarely a case where a solution covers a real-life situation completely. In this paper, a particular dynamic vehicle routing problem is being analyzed. It consists of rescue path planning independently flying drones or driving vehicles in a disaster simulation. The scenario includes continuous updates of injured people that need to be picked up by rescue drones, limited operation range, prioritization of the pickup order depending on the injury level, and a number of people at a certain rescue location. This paper discusses how the dynamic vehicle routing problem can be broken down into a set of static vehicle routing problems. Those problems are then optimized with the help of a particular ant algorithm — in this particular case, an adapted Ant Colony System (ACS). This paper discusses the modelling of the rescue problem as a particular vehicle routing problem and the adaptation of the Ant Colony Optimization (ACO) to solve it.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.