RE: travelling salesman on Mahout

2014-01-16 Thread simon.2.thompson
these folks and see if they can help you get a leg up. Best, Simon -Original Message- From: Ted Dunning [mailto:ted.dunn...@gmail.com] Sent: 13 January 2014 18:00 To: user@mahout.apache.org Subject: Re: travelling salesman on Mahout On Mon, Jan 13, 2014 at 8:42 AM, Pavan K Narayanan

Re: travelling salesman on Mahout

2014-01-13 Thread Ted Dunning
On Mon, Jan 13, 2014 at 8:42 AM, Pavan K Narayanan pavan.naraya...@gmail.com wrote: Please may I ask why TSP has been removed from Mahout. It was the Genetic Algorithms that were removed. The implementation was unmaintained and not scalable and thus not appropriate for Mahout. Its just

Re: travelling salesman on Mahout

2014-01-12 Thread Pavan K Narayanan
Thanks Ted for your response. Any use cases where the evolutionary algorithm used apart from tsp ? I got to know about a mahout cookbook that has a receipe walkthrough on implementing TSP on mahout. The book is not released in my country yet, but I would like to find out: which version of Mahout

Re: travelling salesman on Mahout

2014-01-12 Thread Ted Dunning
I haven't seen that part of the cookbook yet either. But the package that it depends on has been removed from Mahout. Evolutionary algorithms will generally be much better implemented on a framework that supports iteration such as Giraph or Spark. For TSP, the natural representation would be to

Re: travelling salesman on Mahout

2014-01-12 Thread Ted Dunning
For what it is worth, R has some really nice interfaces for the standard TSP solvers and several sample data sets. That can really help you in your testing. See http://cran.r-project.org/web/packages/TSP/vignettes/TSP.pdf On Sun, Jan 12, 2014 at 1:20 AM, Pavan K Narayanan

Re: travelling salesman on Mahout

2014-01-10 Thread Ted Dunning
TSP is generally solved using a number of heuristics guiding a randomized search. Mahout has essentially no provision for helping with this. If you want a quick and dirty solution, I would recommend something like an evolutionary algorithm in which you have segments that self-assemble or split