Abstract
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 real-world networks is computationally challenging. We propose one approximate solution with bounded approximation ratio and one exact solution which computes the optimal itinerary by exploring a limited number of paths in the road network. In addition, an effective compression algorithm is developed to reduce the size of the network, providing a significant acceleration in our exact solution. We conduct extensive empirical evaluations on the road network and POI datasets of Los Angeles and our results confirm the effectiveness and efficiency of our solutions.
L. Bonomi—Joint first author.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
After data cleaning.
- 2.
We discarded the trivial instances, which result in empty or single-category meeting graphs.
References
Cao, X., Chen, L., Cong, G., Xiao, X.: Keyword-aware optimal route search. VLDB Endow. 5(11), 1136–1147 (2012)
Chen, H., Ku, W.S., Sun, M.T., Zimmermann, R.: The multi-rule partial sequenced route query. In: GIS 2008, pp. 10:1–10:10 (2008)
Kanza, Y., Levin, R., Safra, E., Sagiv, Y.: Interactive route search in the presence of order constraints. VLDB Endow. 3(1–2), 117–128 (2010)
Hashem, T., Hashem, T., Ali, M.E., Kulik, L.: Group trip planning queries in spatial databases. In: Nascimento, M.A., Sellis, T., Cheng, R., Sander, J., Zheng, Y., Kriegel, H.-P., Renz, M., Sengstock, C. (eds.) SSTD 2013. LNCS, vol. 8098, pp. 259–276. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40235-7_15
Chen, G., Wu, S., Zhou, J., Tung, A.: Automatic itinerary planning for traveling services. TKDE 26(3), 514–527 (2014)
Hashem, T., Barua, S., Ali, M.E., Kulik, L., Tanin, E.: Efficient computation of trips with friends and families. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, CIKM 2015, pp. 931–940. ACM, New York (2015)
Samrose, S., Hashem, T., Barua, S., Ali, M.E., Uddin, M.H., Mahmud, M.I.: 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, June 2015
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Amer-Yahia, S., Roy, S.B., Chawlat, A., Das, G., Yu, C.: Group recommendation: semantics and efficiency. VLDB Endow. 2(1), 754–765 (2009)
Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005). doi:10.1007/11535331_16
Kanza, Y., Safra, E., Sagiv, Y., Doytsher, Y.: Heuristic algorithms for route-search queries over geographical data. In: GIS 2008, pp. 11:1–11:10 (2008)
Roy, S.B., Das, G., Amer-Yahia, S., Yu, C.: Interactive itinerary planning. In: ICDE, pp. 15–26 (2011)
Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The optimal sequenced route query. VLDB J. 17(4), 765–787 (2008)
Zhang, X., Asano, Y., Yoshikawa, M.: Mutually beneficial confluent routing. IEEE Transactions on Knowledge and Data Engineering (2016). Preprint
Shang, S., Chen, L., Wei, Z., Jensen, C.S., Wen, J.R., Kalnis, P.: Collective travel planning in spatial networks. IEEE Trans. Knowl. Data Eng. 28(5), 1132–1146 (2016)
Ahmadi, E., Nascimento, M.A.: k-optimal meeting points based on preferred paths. In: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, pp. 47:1–47:4. ACM, New York (2016)
Jahan, R., Hashem, T., Barua, S.: Group trip scheduling (GTS) queries in spatial databases. In: Proceedings of the 20th International Conference on Extending Database Technology, EDBT 2017, Venice, Italy, 21–24 March 2017, pp. 390–401 (2017)
Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: TransDec: a spatiotemporal query processing framework for transportation systems. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 1197–1200, March 2010
Acknowledgement
The authors wish to thank the anonymous reviewers for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Fan, L., Bonomi, L., Shahabi, C., Xiong, L. (2017). Multi-user Itinerary Planning for Optimal Group Preference. In: Gertz, M., et al. Advances in Spatial and Temporal Databases. SSTD 2017. Lecture Notes in Computer Science(), vol 10411. Springer, Cham. https://doi.org/10.1007/978-3-319-64367-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-64367-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64366-3
Online ISBN: 978-3-319-64367-0
eBook Packages: Computer ScienceComputer Science (R0)