Ant colony algorithm written in JAVA with JavaFX support solving the traveling salesman problem. During the run of the problem it is possible to add and remove nodes from the traveling salesman map. Visualizes the strength of the ant colony algorithm for these types of problems. Multithread support, easy to add different types of methods for the calculation of pheromones and other optimizations.