|acopt.jar||(46 kb)||executable Java archive|
|acopt.zip||(28 kb)||acopt.tar.gz||(25 kb)||Java sources, version 1.6 (2018.11.14)|
ACOpt is a program to demonstrate the optimization process of ant colony optimization for the traveling salesman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.