I'm working a little phone app for myself, and I'm hoping to get some input on a problem I'm having.
This thing I'm working on is simply put a route planner, of sorts. I give the app a start- and finish destination, the app then uses the Nokia Places API to find specific places in the area between these two points. What I then need to do, is create a route from start to finish, that will also go through some of these places (not all, like maybe 5-15 or so). This route should of course be a 'natural' route, so that I don't go to a place, and then have go backwards to get to another place, etc.
I am not quite sure how to pick these places, but the idea I am currently working with, is to get a plain route only from start to finish, and then pick the places closest to sample points positioned at (total_distance / num_stops) along the route. This would make the route fairly predictable and boring, though.
Any ideas/suggestions for this? Is there some graph theory that can be applied to this