An algorithm for finding shortest path tree using ant colony optimization metaheuristic
[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee
2014
chapter in monograph / paper
english
EN This paper introduces the ShortestPathTreeACO algorithm designed for finding near-optimal and optimal solutions for the shortest path tree problem. The algorithm is based on Ant Colony Optimization metaheuristic, and therefore it is of significant importance to choose proper operation parameters that guarantee the results of required quality. The operation of the algorithm is explained in relation to the pseudocode introduced in the paper. An exemplary execution of the algorithm is depicted and discussed on a step-by-step basis. The experiments carried out within the custom-made framework of the experiment are the source of suggestions concerning the parameter values. The influence of the choice of the number of ants and the pheromone evaporation speed is investigated. The quality of generated solutions is addressed, as well as the issues of execution time.
317 - 326