The use of ant colony optimization algorithms for the problem of optimal route search

No Thumbnail Available

Date

2015

Journal Title

Journal ISSN

Volume Title

Publisher

Lviv Polytechnic Publishing House

Abstract

This paper introduces the ant colony system , a distributed algorithm that is applied to the traveling salesman problem In the ant colony system, a set of cooperating agents called ants cooperate to find good solutions to traveling salesman problems. Ant algorithms- a class meta heuristic methods solving combinatorial optimization problems. The basis of these algorithms responsible behavior of real ants in nature. Ants - a collective beings who build very complex social structure. Their ability to find optimal paths from nest to food sources has attracted the attention of scientists long ago. By submitting information to each other through chemicals including pheromone, ants form a chain of positive feedback. This relationship, in turn, leads to the fact that the ants eventually choose more optimal (short) path to the goal, although at the beginning there were many and they were very different.

Description

Keywords

ant colony system, traveling salesman problem, ant algorithms, optimization traveling salesman route, taboo-list, visibility and virtual pheromone trail

Citation

Rybchak Z. The use of ant colony optimization algorithms for the problem of optimal route search / Zoriana Rybchak, Vasyl Lytvyn, Natalia Kunanets // Litteris et Artibus : proceedings of the 5th International youth science forum, November 26–28, 2015, Lviv, Ukraine / Lviv Polytechnic National University. – Lviv : Lviv Polytechnic Publishing House, 2015. – P. 62–65. – Bibliography: 19 titles.