TSP Ant Optimization (w/s)

This applet shows an ACO (Ant Colony Optimization) implementation that calculates a solution for the TSP (Traveling Salesman Problem). Its possible to iterate over a graph with hundreds of nodes, whereas the exact algorithm stucks with 7-8 Nodes because of NP-hard complexity.

Description of the Algorithm (305 KB)

Java Sourcecode (554 KB)

Schreibe einen Kommentar