Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 356 Bytes

README.md

File metadata and controls

6 lines (5 loc) · 356 Bytes

ant_colony_java_TSP

Bays29 Travelling Salesman Problem (with 29 cities) solution using Java and Ant Colony Optimization methods. This is using adaptive algorithms.

If you want to learn more about it read the following paper:
M. Dorigo & T. Stützle, Ant Colony Optimization, MIT Press, 2004
https://mitpress.mit.edu/books/ant-colony-optimization