A learnheuristic approach for the team aerial drone motion constraints orienteering problem with

被引:0
|
作者
Bayliss, Christopher [1 ,2 ]
Juan, Angel A. [1 ,2 ]
Currie, Christine S. M. [3 ]
Panadero, Javier [1 ,2 ]
机构
[1] Univ Oberta Catalunya, IN3, Barcelona, Spain
[2] Euncet Business Sch, Barcelona, Spain
[3] Univ Southampton, Math Sci Dept, Southampton, Hants, England
关键词
Team orienteering problem; Metaheuristics; Machine learning; Learnheuristics; Aerial drones; Route-dependent edge times; FACILITY LOCATION PROBLEM; VEHICLE-ROUTING PROBLEM; EVOLUTIONARY ALGORITHM; BIASED RANDOMIZATION; OPTIMIZATION; CURVATURE; GRASP; AIR;
D O I
10.1016/j.asoc.2020.106280
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work proposes a learnheuristic approach (combination of heuristics with machine learning) to solve an aerial-drone team orienteering problem. The goal is to maximise the total reward collected from information gathering or surveillance observations of a set of known targets within a fixed amount of time. The aerial drone team orienteering problem has the complicating feature that the travel times between targets depend on a drone's flight path between previous targets. This path-dependence is caused by the aerial surveillance drones flying under the influence of air-resistance, gravity, and the laws of motion. Sharp turns slow drones down and the angle of ascent and air-resistance influence the acceleration a drone is capable of. The route dependence of inter-target travel times motivates the consideration of a learnheuristic approach, in which the prediction of travel times is outsourced to a machine learning algorithm. This work proposes an instance-based learning algorithm with interpolated predictions as the learning module. We show that a learnheuristic approach can lead to higher quality solutions in a shorter amount of time than those generated from an equivalent metaheuristic algorithm, an effect attributed to the search-diversity enhancing consequence of the online learning process. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 50 条
  • [41] A TABU search heuristic for the team orienteering problem
    Tang, H
    Miller-Hooks, E
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) : 1379 - 1407
  • [42] The multi-district team orienteering problem
    Angelica Salazar-Aguilar, M.
    Langevin, Andre
    Laporte, Gilbert
    COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 76 - 82
  • [43] Set Team Orienteering Problem with Time Windows
    Gunawan, Aldy
    Yu, Vincent F.
    Sutanto, Andro Nicus
    Jodiawan, Panca
    LEARNING AND INTELLIGENT OPTIMIZATION, LION 15, 2021, 12931 : 142 - 149
  • [44] Robust Team Orienteering Problem with Decreasing Profits
    Yu, Qinxiao
    Cheng, Chun
    Zhu, Ning
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) : 3215 - 3233
  • [45] The capacitated team orienteering problem with incomplete service
    Archetti, Claudia
    Bianchessi, Nicola
    Speranza, M. Grazia
    OPTIMIZATION LETTERS, 2013, 7 (07) : 1405 - 1417
  • [46] A novel Randomized Heuristic for the Team Orienteering Problem
    Zettam, Manal
    Elbenani, Bouazza
    PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL'16), 2016,
  • [47] Clonal Selection Algorithm for the Team Orienteering Problem
    Karoum, Bouchra
    Elbenani, Bouazza
    2016 11TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA), 2016,
  • [48] An adaptive heuristic for the Capacitated Team Orienteering Problem
    Ben-Said, Asma
    El-Hajj, Racha
    Moukrim, Aziz
    IFAC PAPERSONLINE, 2016, 49 (12): : 1662 - 1666
  • [49] The Team Orienteering Problem with Capacity Constraint and Time Window
    Li, Zhenping
    Hu, Xianman
    OPERATIONS RESEARCH AND ITS APPLICATIONS: IN ENGINEERING, TECHNOLOGY AND MANAGEMENT, 2011, 14 : 157 - +
  • [50] Reformulation and Metaheuristic for the Team Orienteering Arc Routing Problem
    Ke, Liangjun
    Yang, Weibo
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT II, 2017, 10386 : 494 - 501