Abstract. Ant colony optimization (ACO) algorithms are considered and discussed. New ACO algorithm for travelling salesman problem (TSP) is suggested. The experimental investigations of the suggested algorithm for solution of TSP were performed and presented in this paper.

Keywords: Ant colony optimization algorithm, travelling salesman problem, global and local optimization

Link:

ИССЛЕДОВАНИЕ МУРАВЬИНЫХ АЛГОРИТМОВ ОПТИМИЗАЦИИ В ЗАДАЧЕ КОММИВОЯЖЕРА

Юрий Зайченко, Николай Мурга

http://www.foibg.com/ijima/vol02/ijima02-04-p08.pdf