A comparative analysis of three algorithms for solving the salesman problem is performed. These algorithms are Ant Colony Optimization (ASO) and its modifications: Ant Colony System (ACS) and Max-Min Ant System (MMAS). For this purpose, a software implementation of these three ant algorithms has been developed, which simulate the natural behavior of forage ants in finding the shortest path to deliver food to the anthill. The possibilities of the developed computer program are described. The results of a computer experiment are given on a specific example. The program allows you to visualize the shortest route found by each ant algorithm. A comparative analysis of the results, conclusions about the advantages and disadvantages of the considered ant algorithms.