Skip to main content

The Research and Improvement of Path Optimization in Vehicle Navigation

  • Conference paper
Advances in Multimedia, Software Engineering and Computing Vol.2

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 129))

  • 1042 Accesses

Abstract

The shortest path finding problem is the core of route optimization algorithm. And the shortest path finding is one of the most important modules of the traffic navigation system. There are many kinds of route optimization algorithms, including some famous algorithms like: Dijkstra, Bellman-Ford, Floyd-Warshall, A* algorithm and so on. Even the same algorithm has a variety of different implementations. This paper provides an improved route optimization algorithm by improving and researching on the memory occupation and searching time consumption of Dijkstra algorithm. Finally, simulation results show that the improved algorithm has a higher efficiency than the original.

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

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. Yu, D., Zhang, Q., Ma, S., Fang, T.: Optimized Dijkstra Algorithm. Computer Engineering 22, 145–146 (2004)

    Google Scholar 

  2. Xiao, J., Xie, J.: Technology of Dynamic Routing Based on Dijkstra Algorithm and Simulation. Computer Measurement & Control. 18, 1669–1672 (2010)

    Google Scholar 

  3. Xia, S., Han, Y.: An Improved Implementation of Shortest Path Algorithm in GIS. Bulletin of Surveying and Mapping 9, 40–42 (2004)

    Google Scholar 

  4. Sun, Q., Shen, J., Gu, J.: An Improved Algorithm of the Dijkstra Algorithm. Wan Fang Data 03, 99–101 (2002)

    Google Scholar 

  5. Li, J., Li, Q., Yang, L.: Modeling of Urban Traffic System Based on Dynamic Stochastic Fluid Petri Net. Journal of Transportation Systems Engineering and Information Technology 01, 134–139 (2010)

    Google Scholar 

  6. Dong, J., Gao, H.: Design and Implementation of Path Optimization Algorithm in Dynamic Networks based on PDA. Journal of Zhengzhou University of Light Industry 24, 93–95 (2009)

    Google Scholar 

  7. Zhang, Z., Hu, H., Zhong, G., Zheng, C.: SuperMap GIS Application and development tutorial. Wuhan University Press (2006)

    Google Scholar 

  8. Program Fan BBS, http://bbs.pfan.cn/

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

Huang, B., Wu, W., Zheng, Y. (2011). The Research and Improvement of Path Optimization in Vehicle Navigation. In: Jin, D., Lin, S. (eds) Advances in Multimedia, Software Engineering and Computing Vol.2. Advances in Intelligent and Soft Computing, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25986-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25986-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25985-2

  • Online ISBN: 978-3-642-25986-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics