Space: Apache Mahout (https://cwiki.apache.org/confluence/display/MAHOUT) Page: Traveling Salesman (https://cwiki.apache.org/confluence/display/MAHOUT/Traveling+Salesman)
Edited by Ted Dunning: --------------------------------------------------------------------- h1. Intro The Traveling Salesman Problem (TSP) is a classic computer science question classified as NP-Hard. See http://en.wikipedia.org/wiki/Travelling_salesman_problem for background information. h1. Evolutionary Example As an example of evolutionary programming, Mahout has an example implementation that attempts to solve TSP. It should be noted that the implementation of evolutionary programming in Mahout has not been maintained for some time and may be removed in the future due to lack of interest. To run the example, do: # cd <MAHOUT_HOME> # mvn install # Run the Job: {code}./bin/mahout org.apache.mahout.ga.watchmaker.travellingsalesman.TravellingSalesman{code} Change your notification preferences: https://cwiki.apache.org/confluence/users/viewnotifications.action
