1792. Fair location-allocation in disaster response: A metaheuristic approach
Invited abstract in session TB-7: Scheduling in humanitarian operations, stream Scheduling and Project Management.
Tuesday, 10:30-12:00Room: Clarendon GR.01
Authors (first author is the speaker)
| 1. | Özge ŞATIR AKPUNAR
|
| Industrial Engineering, Manisa Celal Bayar University | |
| 2. | Şener Akpınar
|
| Industrial Engineering, Dokuz Eylül University |
Abstract
Drones have become an essential tool in disaster response, enabling efficient operations in areas with limited access. Given the urgency of the response and resource constraints, optimising the use of drones is critical to improve operational efficiency and effectiveness. This work investigates the problem of multiple visit coverage tours for drones to maximise temporal coverage in a disaster area while ensuring a fair distribution of service time. The system is designed to optimise the use of drones by maximising the number of regions served while maintaining an equitable distribution of operating time across all areas, within the constraints imposed by battery life. This ensures that each region receives a fair and comparable amount of service, effectively balancing coverage and resource constraints. A Mixed Integer Linear Program (MILP) is formulated by incorporating decisions on region selection, service time optimisation and visit scheduling. A metaheuristic based on greedy and local search algorithms is proposed to solve larger instances within a reasonable computational time.
Keywords
- Disaster and Crisis Management
- Metaheuristics
- Mathematical Programming
Status: accepted
Back to the list of papers