Maximising reward from a team of surveillance drones: a simheuristic approach to the stochastic team orienteering problem
Angel A. Juan,
Christopher Bayliss and
European Journal of Industrial Engineering, 2020, vol. 14, issue 4, 485-516
We consider the problem of routing a team of unmanned aerial vehicles (drones) being used to take surveillance observations of target locations, where the value of information at each location is different and not all locations need be visited. As a result, this problem can be described as a stochastic team orienteering problem (STOP), in which travel times are modelled as random variables following generic probability distributions. The orienteering problem is a vehicle-routing problem in which each of a set of customers can be visited either just once or not at all within a limited time period. In order to solve this STOP, a simheuristic algorithm based on an original and fast heuristic is developed. This heuristic is then extended into a variable neighbourhood search (VNS) metaheuristic. Finally, simulation is incorporated into the VNS framework to transform it into a simheuristic algorithm, which is then employed to solve the STOP. [Received 5 January 2019; Revised 15 June 2019; Accepted 13 October 2019]
Keywords: simulation-optimisation; unmanned aerial vehicles; UAVs; team orienteering problem; TOP; simheuristics. (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:14:y:2020:i:4:p:485-516
Access Statistics for this article
More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().