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.

---

The paper was partially supported by the National Science Centre of Poland, grant OPUS no. 2017/25/B/ST7/02181 and statutory grant no. 0401/0023 /18 of Faculty of Electronics, Wrocław Universityof Science and Technology.