Route Optimization for Drilling Machine: Properties of AI Algorithms and An Experimentation System for the Practical Users

Abstract

The considered problem of finding drilling machine route is a modified version of TSP. The modification consists in necessity of cyclic drill change which requires returning to starting point after performing a certain number of bores - depending on physical parameters of the particular process. In order to find the best route AI approaches have been applied. In the paper the properties of the implemented algorithms based on Simulated Annealing, Genetic ideas, Ant Colony Optimization have been studied. The Brute Force as reference algorithm as well as Simulated Bee Colony algorithm was implemented, either. The analysis of properties of algorithms was made by processing the results of two-stage simulation experiments. The experiments were carried out with the created and implemented experimentation system. The system also can be used by the practical users for solving their problems.