Skip to main content

Study and Practice of an Improving Multi-path Search Algorithm in a City Public Transportation Network

  • Conference paper
Advanced Electrical and Electronics Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 87))

  • 3235 Accesses

Abstract

Shortest path search is one of key problems for big-scale city public transportation network (CPTN) query system. Based on the current main search algorithms and data models on multi-path search, an improving multi-path search algorithm combined A* and deviation path was proposed in this paper. With our algorithm, not only the optimal path could be provided, but also Kth approaching optimal paths could be displayed. Due to the analysis on algorithm complexity and evaluation experiment, the algorithm efficiency for multi-path search is much better than typical Djikstra algorithm and collection algorithm. Thus, it is more suitable on shortest path search for big-scale real-time CPTN.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wang, L., Cao, S.: Choose a city bus lines travel based on breadth first. In: The Second Intelligent Computing Conference, pp. 3–6 (2008)

    Google Scholar 

  2. Zhou, C., Li, S.: Research of Dijkstra algorithm and A * Algorithm. Software Guide 37(2), 32–36 (2007)

    Google Scholar 

  3. Fu, J., Li, X., Chen, J.: A Practical Algorithm for Finding the Shortest Kth Path Based on Deviation Path. Computer Technology and Development, 1–4 (February 2009)

    Google Scholar 

  4. Wu, M., Su, H., Wang, M.: Research And Implementation for the Algorithm of kth Apporoching Shortest Path. Computer Applications and Software, 1–3 (August 2004)

    Google Scholar 

  5. Liang, H., Yuan, X.-q., Liu, R.: Novel model and realization of public transport route inquiring system. Computer Engineering And Applications 43(3), 15–43 (2007)

    Google Scholar 

  6. Mokhtar, A., Azizo gou, M.: Adaptive wavelength routing in all = optical networks. IEEE/ACM Trans. on Networking 7(5), 767–778 (1999)

    Article  Google Scholar 

  7. Bielli, M., Boulmakoul, A., Mouncif, H.: Object modeling and path computation for multimodal travel systems, 10–13 (April 2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, X., Zheng, X., Yan, C. (2011). Study and Practice of an Improving Multi-path Search Algorithm in a City Public Transportation Network. In: Lee, J. (eds) Advanced Electrical and Electronics Engineering. Lecture Notes in Electrical Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19712-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19712-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19711-6

  • Online ISBN: 978-3-642-19712-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics