Algorithm for finding the most suitable compromise for multiple travelers
I wondered for a long time if there was already a known algorithm solving the following problem, or at least part of it.
Let's say there is a finite set of places (x, y), and each of those places also has a type (house, restaurant, cafe, cinéma ...) and weight (user rating, value for money ...). Moreover, there is a subset of routes faster than others (depending on the type of transport and the desired arrival time).
The answer to the question is: we are a group of people, all of which are located in different places, we want to meet at time T, find the best place (minimizing the length of each path and travel time) of type t (cinema ...).
Does this sound like any known algorithm?
Regards, Rolf
source to share
There are several algorithms to solve this problem, this problem is known as object location or center k problem http://en.wikipedia.org/wiki/Facility_location it a NP Hard problem and there are some algorithms that approximate solutions as well as finding the problem "optimal meeting point", which he used in spatial databases.
source to share