Optimal group route query: Finding itinerary for group of users in spatial databases
- 109 Downloads
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.
KeywordsRoute planning Social trip Optimization
The authors would like to thank the anonymous reviewers for their valuable feedback that helped to improve the quality of the paper.
- 1.Ahmadi E, Nascimento MA (2016) k-optimal meeting points based on preferred paths. In: Proceedings of the 24th ACM SIGSPATIAL international conference on advances in geographic information systems, GIS ’16, pp 47:1–47:4. https://doi.org/10.1145/2996913.2996994. ACM, New York
- 4.Chen G, Wu S, Zhou J, Tung A (2014) Automatic itinerary planning for traveling services. TKDE 26(3):514–527Google Scholar
- 5.Chen H, Ku WS, Sun MT, Zimmermann R (2008) The multi-rule partial sequenced route query. In: GIS ’08, pp 10:1–10:10. https://doi.org/10.1145/1463434.1463448
- 6.Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, CambridgeGoogle Scholar
- 7.Demiryurek U, Banaei-Kashani F, Shahabi C (2010) Transdec:a spatiotemporal query processing framework for transportation systems. In: 2010 IEEE 26th international conference on data engineering (ICDE 2010), pp 1197–1200. https://doi.org/10.1109/ICDE.2010.5447745
- 9.Fan L, Bonomi L, Shahabi C, Xiong L (2017) Multi-user itinerary planning for optimal group preference. In: Gertz M, Renz M, Zhou X, Hoel E, Ku WS, Voisard A, Zhang C, Chen H, Tang L, Huang Y, Lu CT, Ravada S (eds) Advances in Spatial and Temporal Databases. Springer International Publishing, Cham, pp 3–23CrossRefGoogle Scholar
- 11.Hashem T, Barua S, Ali ME, Kulik L, Tanin E (2015) Efficient computation of trips with friends and families. In: Proceedings of the 24th ACM international on conference on information and knowledge management, CIKM ’15. https://doi.org/10.1145/2806416.2806433. ACM, New York, pp 931–940
- 13.Jahan R, Hashem T, Barua S (2017) Group trip scheduling (GTS) queries in spatial databases. In: Proceedings of the 20th international conference on extending database technology, EDBT 2017, Venice, Italy, March 21-24, 2017., pp 390–401. https://doi.org/10.5441/002/edbt.2017.35
- 16.Samrose S, Hashem T, Barua S, Ali ME, Uddin MH, Mahmud MI (2015) Efficient computation of group optimal sequenced routes in road networks. In: 2015 16th IEEE international conference on mobile data management, vol 1, pp 122–127. https://doi.org/10.1109/MDM.2015.68
- 18.Tabassum A, Barua S, Hashem T, Chowdhury T (2017) Dynamic group trip planning queries in spatial databases. In: Proceedings of the 29th international conference on scientific and statistical database management, p 38. ACMGoogle Scholar