A simheuristic for the unmanned aerial vehicle surveillance-routing problem with stochastic travel times and reliability considerations
Document typeConference report
Rights accessOpen Access
In the unmanned aerial vehicle (UAV) surveillance-routing problem, a limited fleet of UAVs with driving-range limitations have to visit a series of target zones in order to complete a monitoring operation. This operation typically involves taking images and / or registering some key performance indicators. Whenever this surveillance action is repetitive, a natural goal to achieve is to complete each cycle of visits as fast as possible, so that the number of times each target zone is visited during a time interval is maximized. Since many factors might influence travel times, they are modeled as random variables. Reliability issues are also considered, since random travel times might cause that a route cannot be successfully completed before the UAV runs out of battery. In order to solve this stochastic optimization problem, a simheuristic algorithm is proposed. Computational experiments contribute to illustrate these concepts and to test the quality of our approach.
CitationPanadero, J. [et al.]. A simheuristic for the unmanned aerial vehicle surveillance-routing problem with stochastic travel times and reliability considerations. A: Winter Simulation Conference. "Proceeding of the 2019 Winter Simulation Conference". 2019, p. 1883-1893.
- Departament d'Enginyeria Civil i Ambiental - Ponències/Comunicacions de congressos 
- Departament de Matemàtiques - Ponències/Comunicacions de congressos 
- BIT - Barcelona Innovative Transportation - Ponències/Comunicacions de congressos 
- GRBIO - Grup de Recerca en Bioestadística i Bioinformàtica - Ponències/Comunicacions de congressos