Efficient Tabu Search Algorithm for the Cyclic Inspection Problem

被引:0
作者
Bozejko, Wojciech [1 ]
Grymin, Radoslaw [1 ]
Pempera, Jaroslaw [1 ]
Wodecki, Mieczyslaw [2 ]
机构
[1] Wroclaw Univ Sci & Technol, Dept Control Syst & Mechatron, Wybrzeze Wyspianskiego 27, PL-50370 Wroclaw, Poland
[2] Wroclaw Univ Sci & Technol, Dept Telecommun & Teleinformat, Wybrzeze Wyspianskiego 27, PL-50370 Wroclaw, Poland
来源
16TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MODELS IN INDUSTRIAL AND ENVIRONMENTAL APPLICATIONS (SOCO 2021) | 2022年 / 1401卷
关键词
APPROXIMATION ALGORITHMS; SALESMAN;
D O I
10.1007/978-3-030-87869-6_71
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Unmanned aerial vehicles (UAVs) are a powerful tool for remote monitoring of objects requiring early anomaly detection, emergency intervention, or measurement data collection. We consider the problem of determining the optimal path of a UAV performing remote inspection of objects. The UAV inspects objects repeatedly (infinitely many times) every specified period of time. We propose an effective heuristic algorithm based on the tabu search method. In its construction, we used some properties of the problem under consideration.
引用
收藏
页码:751 / 757
页数:7
相关论文
共 16 条
  • [1] APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM
    ARKIN, EM
    HASSIN, R
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) : 197 - 218
  • [2] An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
    Behdani, Behnam
    Smith, J. Cole
    [J]. INFORMS JOURNAL ON COMPUTING, 2014, 26 (03) : 415 - 432
  • [3] A novel discretization scheme for the close enough traveling salesman problem
    Carrabs, Francesco
    Cerrone, Carmine
    Cerulli, Raffaele
    Gaudioso, Manlio
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 78 : 163 - 171
  • [4] A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
    Coutinho, Walton Pereira
    do Nascimento, Roberto Quirino
    Pessoa, Artur Alves
    Subramanian, Anand
    [J]. INFORMS JOURNAL ON COMPUTING, 2016, 28 (04) : 752 - 765
  • [5] Approximation algorithms for TSP with neighborhoods in the plane
    Dumitrescu, A
    Mitchell, JSB
    [J]. JOURNAL OF ALGORITHMS, 2003, 48 (01) : 135 - 159
  • [6] FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE
    GLOVER, F
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) : 533 - 549
  • [7] Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]
  • [8] Mata C. S., 1995, Proceedings of the Eleventh Annual Symposium on Computational Geometry, P360, DOI 10.1145/220279.220318
  • [9] Mennell W., 2011, 2 INFORMS COMP SOC C
  • [10] Mennell W. K., 2009, THESIS