Skip to main content
SpringerLink
Log in

Application of Shortest Path Search Algorithm in Disaster Decision Support System

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7002))

  • 2321 Accesses

Abstract

Core setting region could facilitate disaster relief and strength communication among setting regions when emergent disaster happens. Shortest path search algorithms could be applied. Dijkstra algorithm is discussed and is improved to solve the confirmation of core setting region. It ensures that the core setting region is the nearest to the farthest region. The improved algorithm turns out to be practical.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Huang, D.-m., Fang, Q.: Application of Improved Dijkstra Algorithm in Storm Surge System. Computer Engineering (October 2010)

    Google Scholar 

  2. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73(2) (1996)

    Google Scholar 

  3. Li, X.-f., Zhang, H.-l., Liu, Z.-j., Wang, R.-b.: Problem for shortest path problem based on heuristic algorithm. Journal of Jilin University (Engineering and Technology Edition) (January 2011)

    Google Scholar 

  4. Lu, Z., Shi, J.: Design and implementation of parallel shortest path search algorithm. Computer Engineering and Applications (March 2010)

    Google Scholar 

  5. Hribar, M.R., Taylor, V.E.: Temination detection for parallel shortst path algorithms.Technical Report CSE-97-004 Computer Science-Engineering, EECS Department. Northwestern University, Chicago (1997)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Glorious Sun School of Business and Management, Donghua University, Shanghai, China

    Huijuan Zhao

  2. Information College, Shanghai Ocean University, Shanghai, China

    Huijuan Zhao & Dongmei Huang

Authors
  1. Huijuan Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongmei Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Business Information Technology, RMIT University, City Campus, 124 La Trobe Street, 3000, Melbourne, VIC, Australia

    Hepu Deng

  2. School of Electronics and Information, Tongji University, 201804, Shanghai, China

    Duoqian Miao

  3. School of Computer and Information Engineering, Shanghai University of Electric Power, 200090, Shanghai, China

    Jingsheng Lei

  4. Department of Business Administration, Caritas Institute of Higher Education, 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China

    Fu Lee Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, H., Huang, D. (2011). Application of Shortest Path Search Algorithm in Disaster Decision Support System. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23881-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23881-9_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation