Skip to main content
SpringerLink
Log in

The partial sequenced route query with traveling rules in road networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

In modern geographic information systems, route search represents an important class of queries. In route search related applications, users may want to define a number of traveling rules (traveling preferences) when they plan their trips. However, these traveling rules are not considered in most existing techniques. In this paper, we propose a novel spatial query type, the multi-rule partial sequenced route (MRPSR) query, which enables efficient trip planning with user defined traveling rules. The MRPSR query provides a unified framework that subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. The difficulty in answering MRPSR queries lies in how to integrate multiple choices of points-of-interest (POI) with traveling rules when searching for satisfying routes. We prove that MRPSR query is NP-hard and then provide three algorithms by mapping traveling rules to an activity on vertex network. Afterwards, we extend all the proposed algorithms to road networks. By utilizing both real and synthetic POI datasets, we investigate the performance of our algorithms. The results of extensive simulations show that our algorithms are able to answer MRPSR queries effectively and efficiently with underlying road networks. Compared to the Light Optimal Route Discoverer (LORD) based brute-force solution, the response time of our algorithms is significantly reduced while the distances of the computed routes are only slightly longer than the shortest route.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Notes

  1. http://maps.google.com/

  2. http://www.mapquest.com/

  3. http://maps.yahoo.com/

  4. http://maps.bing.com/

References

  1. Digital Chart of the World Server. http://www.maproom.psu.edu/dcw/. Accessed August 2010

  2. U.S. Geological Survey. http://www.usgs.gov/. Accessed August 2010

  3. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD international conference on management of data, pp 322–331

  4. Beeri C, Kanza Y, Safra E, Sagiv Y (2004) Object fusion in geographic information systems. In: Proceedings of the thirtieth international conference on very large data bases (VLDB), pp 816–827

  5. Chen H, Ku WS, Sun MT, Zimmermann R (2008) The multi-rule partial sequenced route query. In: Proceedings of 16th ACM SIGSPATIAL international conference on advances in geographic information systems, p 10

  6. Escudero LF (1988) An inexact algorithm for the sequential ordering problem. Eur J Oper Res 37(2):236–249

    Article  Google Scholar 

  7. Garey MR, Johnson DS (1990) Computers and intractability a guide to the theory of NP-completeness. W. H. Freeman

  8. George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Proceedings of the 10th international symposium on advances in spatial and temporal databases (SSTD), pp 460–477

  9. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD’84, proceedings of annual meeting, pp 47–57

  10. Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24(2):265–318

    Article  Google Scholar 

  11. Horowitz E, Sahni S, Anderson-Freed S (1993) Fundamentals of data strucures in C. W. H. Freeman

  12. Jensen CS, Kolárvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: Proceedings of the 11th ACM international symposium on advances in geographic information systems (ACM-GIS), pp 1–8

  13. Kahn AB (1962) Topological sorting of large networks. Commun ACM 5(11):558–562

    Article  Google Scholar 

  14. Kanza Y, Levin R, Safra E, Sagiv Y (2009) An interactive approach to route search. In: Proceedings of 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 408–411

  15. Kolahdouzan MR, Shahabi C (2004) Voronoi-based K nearest neighbor search for spatial network databases. In: Proceedings of the 30th international conference on very large data bases (VLDB), pp 840–851

  16. Ku WS, Zimmermann R, Wang H, Wan CN (2005) Adaptive nearest neighbor queries in travel time networks. In: Proceedings of the 13th ACM international symposium on advances in geographic information systems (ACM-GIS), pp 210–219

  17. Lee CK, Lee WC, Zheng B (2009) Fast object search on road networks. In: Proceeding of 12th international conference on extending database technology, pp 1018–1029

  18. Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. In: Proceedings of the 9th international symposium on advances in spatial and temporal databases (SSTD), pp 273–290

  19. Ma X, Shekhar S, Xiong H, Zhang P (2006) Exploiting a page-level upper bound for multi-type nearest neighbor queries. In: Proceedings of the 14th ACM international symposium on geographic information systems (ACM-GIS), pp 179–186

  20. Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the 29th international conference on very large data bases (VLDB), pp 802–813

  21. Reddy R (1996) To dream the possible dream. Commun ACM 39(5):105–112

    Article  Google Scholar 

  22. Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, pp 71–79

  23. Russell SJ, Norvig P (2002) Artificial intelligence: a modern approach. Prentice Hall

  24. Samet H (2001) Issues, developments, and challenges in spatial databases and geographic information systems (gis). In: Proceedings of the ninth ACM international symposium on advances in geographic information systems (ACM-GIS), p 1

  25. Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 43–54

  26. Sellis TK, Roussopoulos N, Faloutsos C (1987) The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of 13th international conference on very large data bases (VLDB), pp 507–518

  27. Sharifzadeh M, Kolahdouzan MR, Shahabi C (2008) The optimal sequenced route query. VLDB J 17(4):765–787

    Article  Google Scholar 

  28. Sharifzade M, Shahabi C (2009) Approximate Voronoi cell computation on spatial data streams. VLDB J 18(1):57–75

    Article  Google Scholar 

  29. Sharifzadeh M, Shahabi C (2008) Processing optimal sequenced route queries using voronoi diagrams. GeoInformatica 4(12):411–433

    Article  Google Scholar 

  30. Shekhar S, Coyle M, Goyal B, Liu DR, Sarkar S (1997) Data models in geographic information systems. Commun ACM 40(4):103–111

    Article  Google Scholar 

  31. Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of 28th international conference on very large data bases (VLDB), pp 287–298

  32. Tian Y, Lee CK, Lee WC (2009) Finding skyline paths in road networks. In: Proceedings of 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 444–447

  33. Tian Y, Lee CK, Lee WC (2009) Monitoring minimum cost paths on road networks. In: Proceedings of 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 217–226

  34. Terrovitis M, Bakiras S, Papadias D, Mouratidis K (2005) Constrained shortest path computation. In: Proceedings of the 9th international symposium on advances in spatial and temporal databases (SSTD), pp 181–199

  35. Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based Spatial queries. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, pp 443–454

Download references

Acknowledgements

This research has been funded in part by the National Science Foundation grants CNS-0831502 (CT), CNS-0855251 (CRI).

Author information

Authors and Affiliations

  1. Department of Computer Science and Software Engineering, Auburn University, Auburn, AL, 36849, USA

    Haiquan Chen & Wei-Shinn Ku

  2. Department of Computer Science and Information Engineering, National Central University, Taoyuan, 320, Taiwan

    Min-Te Sun

  3. Department of Computer Science, National University of Singapore, Singapore, 117590, Singapore

    Roger Zimmermann

Authors
  1. Haiquan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Shinn Ku
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Min-Te Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Roger Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei-Shinn Ku.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H., Ku, WS., Sun, MT. et al. The partial sequenced route query with traveling rules in road networks. Geoinformatica 15, 541–569 (2011). https://doi.org/10.1007/s10707-010-0115-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-010-0115-2

Keywords

Search

Navigation