, Volume 22, Issue 4, pp 845–867 | Cite as

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

  • Liyue Fan
  • Luca Bonomi
  • Cyrus Shahabi
  • Li Xiong


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.


Route 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. 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. ACM, New York
  2. 2.
    Amer-Yahia S, Roy SB, Chawlat A, Das G, Yu C (2009) Group recommendation: Semantics and efficiency. VLDB Endow 2 (1):754–765. CrossRefGoogle Scholar
  3. 3.
    Cao X, Chen L, Cong G, Xiao X (2012) Keyword-aware optimal route search. VLDB Endow 5(11):1136–1147. CrossRefGoogle Scholar
  4. 4.
    Chen G, Wu S, Zhou J, Tung A (2014) Automatic itinerary planning for traveling services. TKDE 26(3):514–527Google Scholar
  5. 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.
  6. 6.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, CambridgeGoogle Scholar
  7. 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.
  8. 8.
    Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271. CrossRefGoogle Scholar
  9. 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
  10. 10.
    Hashem T, Ali ME (2017) Trip planning and scheduling queries in spatial databases: A survey. In: Reddy PK, Sureka A, Chakravarthy S, Bhalla S (eds) Big Data Analytics. Springer International Publishing, Cham, pp 164–178CrossRefGoogle Scholar
  11. 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. ACM, New York, pp 931–940
  12. 12.
    Hashem T, Hashem T, Ali ME, Kulik L (2013) Group trip planning queries in spatial databases. Springer, Berlin, pp 259–276. Google Scholar
  13. 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.
  14. 14.
    Kanza Y, Levin R, Safra E, Sagiv Y (2010) Interactive route search in the presence of order constraints. VLDB Endow 3(1-2):117–128. CrossRefGoogle Scholar
  15. 15.
    Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. In: SSTD’05, pp. 273–290. CrossRefGoogle Scholar
  16. 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.
  17. 17.
    Shang S, Chen L, Wei Z, Jensen CS, Wen JR, Kalnis P (2016) Collective travel planning in spatial networks. IEEE Trans Knowl Data Eng 28(5):1132–1146CrossRefGoogle Scholar
  18. 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
  19. 19.
    Zhang X, Asano Y, Yoshikawa M (2016) Mutually beneficial confluent routing. IEEE Transactions on Knowledge and Data Engineering - preprint. Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University at Albany, SUNYAlbanyUSA
  2. 2.University of California - San DiegoLa JollaUSA
  3. 3.University of Southern CaliforniaLos AngelesUSA
  4. 4.Emory UniversityAtlantaUSA

Personalised recommendations