aco
traveling salesman's problem by Ant Colony Optimization (java)
define numCities = n (ex) in TSP.java
it then randomly creates distance matrix for n number of cities.
the # ants # max time is also configurable at the begining of script.
traveling salesman's problem by Ant Colony Optimization (java)
define numCities = n (ex) in TSP.java
it then randomly creates distance matrix for n number of cities.
the # ants # max time is also configurable at the begining of script.