|
Degree
|
Ph. D. (Eng.), Associate Professor of Automated Data Processing Systems and Management Department, Moscow Aviation Institute
|
|
E-mail
|
Pavl101@rambler.ru
|
|
Location
|
Moscow
|
|
Articles
|
This paper analysis the effectiveness of various modifications of the ant colonies method applied to solve the traveling salesman problem. The effectiveness of different algorithms (e. g. the original, elite and rank) was considered in terms of the algorithm convergence speed depending on the number of ants in the colony, the initial stock of pheromone and pheromone evaporation rate. Modification of the ant algorithms, allowing to increase the speed of finding the optimal solution by incorporating the algorithm «Queen» tracking the current state of the solution and the change of the correction algorithm, is proposed.
Read more...
|
