Excerpts from Martin's message of Sun May 02 10:19:13 -0400 2010:
> Hi all,
>
>
>
> i need to implement a sort of "Traveling Salesman" routing algorithmus.
> Imagine a street network and a "person/object." has the task to go from S
> (start) to D (destination) ! He also has to visit the places A,B,C. The
> output should be the shortest path from S, to {A,B,C,} or {B,A,C,}.. To D!
>
>
>
> Does geotools has this kind of algorithmus already implemented? Or anyone
> else?
Hi Martin,
OpenTripPlanner (http://opentripplanner.org), which uses GeoTools, is a routing
engine that supports planning trips with intermediate points (i.e., TSP).
Full disclosure: I'm a contributer :)
-Nick
>
> I would be very grateful if you could help me out ;-)
>
>
>
>
>
> Cheers,
>
> Martin
>
------------------------------------------------------------------------------
_______________________________________________
Geotools-gt2-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
