Efficient Algorithms for Finding Optimal Meeting Point on Road Networks

Given a set of points Q on a road network, an Optimal Meeting Point (OMP) query returns the point on a road network G = (V,E) with the smallest sum of network distances to all the points in Q. This problem has many real world applications, such as minimizing the total travel cost for a group of people who want to find a location for gathering. While this problem has been well studied in the Euclidean space, the recently proposed state-of-the-art algorithm for solving this problem in the context of road networks is still not efficient.

Resource Details

Provided by:
VLD Digital