Traveling Salesman (MAHOUT) created by Grant Ingersoll http://cwiki.apache.org/confluence/display/MAHOUT/Traveling+Salesman
Content: --------------------------------------------------------------------- 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. To run the example, do: # cd <MAHOUT_HOME>/examples # ant job # Run the Job: {code}/bin/hadoop jar <MAHOUT_HOME>/examples/build/apache-mahout-examples-0.1-dev.jar org.apache.mahout.ga.watchmaker.travellingsalesman.TravellingSalesman{code} --------------------------------------------------------------------- CONFLUENCE INFORMATION This message is automatically generated by Confluence Unsubscribe or edit your notifications preferences http://cwiki.apache.org/confluence/users/viewnotifications.action If you think it was sent incorrectly contact one of the administrators http://cwiki.apache.org/confluence/administrators.action If you want more information on Confluence, or have a bug to report see http://www.atlassian.com/software/confluence
