Optimal length determination for mine destruction using 3D traveling salesman problem on a sphere

In military operations, improving the efficiency and shortening the duration of the operation is intended for security by integrating weapons to unmanned systems. Unmanned vehicles are used for works that could endanger human health in defense systems, mine detection and the task of destruction. Mined land is risky to human life and destruction is costly. In this study, it is aimed to optimize cost and time in destruction of mines that have been located. Traveling Salesman Problem was used to solve the problem and three-dimensionality is based on for suitability to real-world problems. In this study, genetic algorithm method is applied to node placed randomly on a three-dimensional sphere.