Hi Daniel,
Here’s an article on the Optimal Meeting Point algorithm:
http://link.springer.com/chapter/10.1007/978-3-642-37134-9_21
Essentially, it calculates the node of the network that stands at the combined shortest distance from a set of given nodes of interest. This is a typical logistics problem.
Regards,
Luís
Hi Luis,How would you define the optimal meeting point?
There is a driving distance function, which can also return the cost to
each point within a certain distance.
To search for the optimal point of three people for example, you could do
three driving distance calculations and then choose the point, which has
smallest equal distance (cost) for each person.
As always, cost can be distance but also time or whatever you choose as
cost.
Daniel
On Tue, May 27, 2014 at 6:25 PM, Luís de Sousa <luis.a.de.sousa@>wrote:
Greetings to all,
Is there any implementation out there of the Optimal Meeting Point (OMP)
algorithm based on pgRouting?Thank you,
Luís
Pgrouting-users mailing list
Pgrouting-users@.osgeo
http://lists.osgeo.org/mailman/listinfo/pgrouting-users
–
Georepublic UG & Georepublic Japan
eMail: daniel.kastl@
Web: http://georepublic.info
Pgrouting-users mailing list
Pgrouting-users@.osgeo
http://lists.osgeo.org/mailman/listinfo/pgrouting-users