Comparison of Algorithms for Finding Best Route in an Area with Obstacles

摘要

In this paper, the problem of finding the route between two distinguished points in an area with obstacles is considered. The problem consists in minimizing the introduced cost function which is taken into account the necessity of crossing some intermediate points. The created and implemented algorithm to solving this problem is based on ant colony optimization. This algorithm is compared with the other implemented heuristic algorithms which had been designed according to genetic algorithm idea, and simulated annealing. The comparative analysis of algorithms' properties is made on the basis of the results of simulations made with the designed and implemented experimentation system. The obtained results of experiments confirmed that the proposed algorithm seems to be very promising.