Skip to main content

Constrained Route Planning Based on the Regular Expression

  • Conference paper
  • First Online:
Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2017)

Abstract

Traditional route planning algorithms, which mainly focus on common metrics to find the optimal route from source to destination, are not enough to solve route planning requirements with location constraints like sequence, alternative and avoidance. For example, finding the shortest path passing the whole or a part of user-defined locations or location categories in order or disorder, or not passing some specified locations or categories. Mainly focusing on these scenarios, this paper formalizes the constrained route planning problem based on the regular expression generated by user requirements and gives a general framework for the exact solution. By using different shortest path algorithms, we show how the framework works efficiently with shortest path algorithms. Finally, extensive experiments on real road network datasets demonstrate the efficiency of our proposal.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liu, H., Jin, C., Zhou, A.: Popular route planning with travel cost estimation. In: DASFAA, (2), pp. 403–418 (2016)

    Google Scholar 

  2. Zhang, S., Qin, L., Zheng, Y., et al.: Effective and efficient: large-scale dynamic city express. IEEE TKDE 28(12), 3203–3217 (2016)

    Google Scholar 

  3. Lu, H.C., Lin, C.Y., Tseng, V.S.: Trip-Mine: an efficient trip planning approach with travel time constraints. In: IEEE International Conference on Mobile Data Management, pp. 152–161 (2011)

    Google Scholar 

  4. Li, F., Cheng, D., Hadjieleftheriou, M., et al.: On trip planning queries in spatial databases. In: SSTD, pp. 273–290 (2005)

    Google Scholar 

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

    Article  Google Scholar 

  6. Sharifzadeh, M., Shahabi, C.: Additively weighted Voronoi diagrams for optimal sequenced route queries. In: Workshop on Spatio-Temporal Database Management. ACM (2009)

    Google Scholar 

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

    Article  Google Scholar 

  8. Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: IEEE International Conference on Data Engineering, pp. 949–960 (2013)

    Google Scholar 

  9. Chen, H., Ku, W.S., Sun, M.T., et al.: The multi-rule partial sequenced route query. In: ACM GIS, pp. 1–10 (2008)

    Google Scholar 

  10. Li, J., Yang, Y., Mamoulis, N.: Optimal route queries with arbitrary order constraints. IEEE TKDE 25(5), 1097–1110 (2013)

    Google Scholar 

  11. Yao, B., Tang, M., Li, F.: Multi-approximate-keyword routing in GIS data. In: ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 201–210 (2011)

    Google Scholar 

  12. Cao, X., Chen, L., Cong, G.: Keyword-aware optimal route search. PVLDB 5(11), 1136–1147 (2012)

    Google Scholar 

  13. Cao, X., Chen, L., Cong, G., et al.: KORS: keyword-aware optimal route search system. In: IEEE International Conference on Data Engineering, pp. 1340–1343 (2013)

    Google Scholar 

  14. Barrett, C., Jacob, R., Marathe, M.: Formal language constrained path problems. Computing 30(3), 234–245 (1998)

    MathSciNet  MATH  Google Scholar 

  15. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  16. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path cost. IEEE Trans. Syst. Sci. Cybern. SSC4 4(2), 100–107 (1968)

    Google Scholar 

Download references

Acknowledgements

Our research is supported by the National Key Research and Development Program of China (2016YFB1000905), National Natural Science Foundation of China (61370101, 61532021, U1501252, U1401256 and 61402180), Shanghai Knowledge Service Platform Project (No. ZF1213) and the Funding Program of International Academic Conference for Graduate Students at East China Normal University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhao Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, J., Liu, H., Zhang, Z. (2018). Constrained Route Planning Based on the Regular Expression. In: Romdhani, I., Shu, L., Takahiro, H., Zhou, Z., Gordon, T., Zeng, D. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 252. Springer, Cham. https://doi.org/10.1007/978-3-030-00916-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00916-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00915-1

  • Online ISBN: 978-3-030-00916-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics