Methods in org.apache.mahout.ga.watchmaker.travellingsalesman with parameters of type ProgressListener |
java.util.List<java.lang.String> |
TravellingSalesmanStrategy.calculateShortestRoute(java.util.Collection<java.lang.String> cities,
ProgressListener progressListener)
Calculates the shortest round trip distance that visits each of the specified cities once and returns to
the starting point. |
java.util.List<java.lang.String> |
EvolutionaryTravellingSalesman.calculateShortestRoute(java.util.Collection<java.lang.String> cities,
ProgressListener progressListener)
Calculates the shortest route using a generational evolutionary algorithm with a single ordered mutation
operator and truncation selection. |
java.util.List<java.lang.String> |
BruteForceTravellingSalesman.calculateShortestRoute(java.util.Collection<java.lang.String> cities,
ProgressListener progressListener)
To reduce the search space we will only consider routes that start and end at one city (whichever is
first in the collection). |