[OSRM-talk] Viaroute

[Dennis Luxen]

> It sounds to me like you would like to do an actual combinatorial optimization - ie. in which order should I visit places x, y, and z to get the shortest total route?

Indeed, it is a combinatorial problem.

> If so this is a classical problem known as the Travelling Salesman Problem - which you can read a bit more about here: http://en.wikipedia.org/wiki/Travelling_salesman_problem
> For TSPs (and similar problems) I use my own optimization algorithms on top of a distance matrix calculated using OSRM, you might want to consider that too.

We’ll have distance table generation built-in in a couple of days. And I can also imagine that one or another (simple) optimization problem solver may follow after that.

—Dennis