Maximising reward from a team of surveillance drones: a simheuristic approach to the stochastic team orienteering problem

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2020-07-16 DOI:10.1504/ejie.2020.108581

Javier Panadero, A. Juan, C. Bayliss, C. Currie

{"title":"Maximising reward from a team of surveillance drones: a simheuristic approach to the stochastic team orienteering problem","authors":"Javier Panadero, A. Juan, C. Bayliss, C. Currie","doi":"10.1504/ejie.2020.108581","DOIUrl":null,"url":null,"abstract":"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]","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2020-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/ejie.2020.108581","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/ejie.2020.108581","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 27

Abstract

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]

查看原文本刊更多论文

从一组无人侦察机中获得最大回报:随机团队定向问题的一种类似启发式方法

我们考虑了一个无人机团队的路线问题，该团队用于对目标位置进行监视观测，其中每个位置的信息价值不同，并且并非所有位置都需要访问。因此，这个问题可以被描述为一个随机团队定向问题（STOP），其中旅行时间被建模为遵循一般概率分布的随机变量。定向越野问题是一个车辆路线问题，其中一组客户中的每一个都可以在有限的时间内访问一次或根本不访问。为了解决这种STOP问题，在原有快速启发式算法的基础上，提出了一种模拟启发式算法。然后将该启发式算法扩展为可变邻域搜索（VNS）元启发式算法。最后，将仿真纳入VNS框架，将其转换为模拟启发式算法，然后使用该算法来解决STOP问题。【2019年1月5日收到；2019年6月15日修订；2019年10月13日接受】

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.