Options

Traveling Salesman Problem

RucaRuca Member Posts: 13 Contributor II
edited November 2018 in Help
Hi There,

I'm a newbie at Rapidminer.
I would like to know if anyone has already implemented the traveling salesman problem using rapidminer.
I'm trying to use the OpenStreetMap in order to collect information about paths. I would like to use rapidminer in order to get the best route from point A to point B using the information from OpenStreetMap. Is there any example which I can refer to?
Thank you.

Regards,

Answers

  • Options
    wilsonchuawilsonchua Member Posts: 3 Contributor I

    Im also interested in this. Currently there is an R package for this. So maybe use Rapidminer's R plugin?

    For more explanation on the TSP 

    https://www.wired.com/2013/01/traveling-salesman-problem/

     

  • Options
    MartinLiebigMartinLiebig Administrator, Moderator, Employee, RapidMiner Certified Analyst, RapidMiner Certified Expert, University Professor Posts: 3,517 RM Data Scientist

    Hi @wilsonchua,

    while TSP is definitely interesting, i would not call it a Data Science Problem. That's the reason why there is no native operator. How would you use it in a DS task?

     

    Best,

    Martin

    - Sr. Director Data Solutions, Altair RapidMiner -
    Dortmund, Germany
  • Options
    BalazsBaranyBalazsBarany Administrator, Moderator, Employee, RapidMiner Certified Analyst, RapidMiner Certified Expert Posts: 955 Unicorn

    Hi!

     

    Where do you store your OpenStreetMap data? The best practice for storing and analyzing OSM data is putting everything into a PostGIS (PostgreSQL) database. The pgrouting package there gives you direct Traveling Sales Person functions:

    http://docs.pgrouting.org/latest/en/TSP-family.html#tsp

    ... and others like Dijkstra and A*. 

     

    Calculating this in the database will give you the best performance.

     

    Regards,

    Balázs

Sign In or Register to comment.