Optimal group route query: Finding itinerary for group of users in spatial databases.

The increasing popularity of location-based applications creates new opportunities for users to travel together. In this paper, we study a novel spatio-social optimization problem, i.e., Optimal Group Route, for multi-user itinerary planning. With our problem formulation, users can individually specify sources and destinations, preferences on the Point-of-interest (POI) categories, as well as the distance constraints. The goal is to find a itinerary that can be traversed by all the users while maximizing the group’s preference of POI categories in the itinerary. Our work advances existing group trip planning studies by maximizing the group’s social experience. To this end, individual preferences of POI categories are aggregated by considering the agreement and disagreement among group members. Furthermore, planning a multi-user itinerary on large road networks is computationally challenging. We propose two efficient greedy algorithms with bounded approximation ratio, one exact solution which computes the optimal itinerary by exploring a limited number of paths in the road network, and a scaled approximation algorithm to speed up the dynamic programming employed by the exact solution. We conduct extensive empirical evaluations on two real-world road network/POI datasets and our results confirm the effectiveness and efficiency of our solutions. [ABSTRACT FROM AUTHOR]