Comparison of Algorithms for Finding Best Route in an Area with Obstacles
Document Type
Conference Proceeding
Publication Date
1-1-2017
Publication Title
Proceedings - 25th International Conference on Systems Engineering, ICSEng 2017
Publisher
Institute of Electrical and Electronics Engineers Inc.
Volume
2017-January
First page number:
163
Last page number:
168
Abstract
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. © 2017 IEEE.
Language
english
Repository Citation
Jarecki, P.,
Kopec, P.,
Pozniak-Koszalka, I.,
Koszalka, L.,
Kasprzak, A.,
Chmaj, G.
(2017).
Comparison of Algorithms for Finding Best Route in an Area with Obstacles.
Proceedings - 25th International Conference on Systems Engineering, ICSEng 2017, 2017-January
163-168.
Institute of Electrical and Electronics Engineers Inc..
http://dx.doi.org/10.1109/ICSEng.2017.51