Algorithm for solving the discrete-continuous inspection problem

© 2020. The Author(s). This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives License (CC BY-NC-ND 4.0 https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits use, distribution, and reproduction in any medium, provided that the article is properly cited, the use is non-commercial, and no modifications or adaptations are made The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which has discrete-continuous nature. In order to solve this problem the use of local search algorithms is proposed

Algorithm for solving the Discrete-Continuous Inspection Problem

The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which has discrete-continuous nature. In order to solve this problem the use of local search algorithms is proposed