Удосконалення методу комбінаторної оптимізації на базі мурашиної колонії

Abstract

In this work has been analyzed the travelling salesman problem. Metaheuristic, which is based on the usage of the behavior of the ant colony, is improved by changing the setting of pheromone values and probabilistic selection of the next node using "greedy" software agents, which reduced the time to solve the salesman's task.