Skip to content

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

mohammedri/ant_colony_java_TSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 

Repository files navigation

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

About

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

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages