TSP

Traveller Salesman Problem

Given full graph of N verticles with edges of different lengths, find shortest cycle passing through all verticles exactly once.

generate data sets

./generate

compile & run benchmarks

./run ant_colony

Ready:

• Greedy Algorithm ( Nearest Neighbour )
• Farthest Insertion
• Bruteforce
• Genetic Algorithm

In Progress:

• Ant Colony Optimization

To Do:

• Simulated Annealing