Skip to main content

A Flood Risk Assessment Based on Maximum Flow Capacity of Canal System

  • Conference paper
  • First Online:
  • 1651 Accesses

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

Abstract

System analysis of network of flows of water is essential for assessing risk of flooding. The flood risk management generally focuses on the meteorological forecasting together with the operation of hydraulic structure while overlooks the flood incurred by inefficient performance of natural instrument in flood mitigation, namely of canal systems. A new methodology for the risk assessment of flood from the prospect of the capacity of canal system is proposed in this paper. The methodology comprises the modeling of a canal system by a flow network in the graph theory, the formulation for the determination of the system capacity in terms of the maximum flow problem, the treatment of uncertainty using copula couple with maximum entropy models, the definition of flood risk event, and the method of risk assessment. The application of the proposed methodology is illustrated through a numerical example.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Borwein, J., Howlett, P., Piantadosi, J.: Modelling and simulation of seasonal rainfall using the principle of maximum entropy. Entropy 16, 747–769 (2014)

    Article  MathSciNet  Google Scholar 

  2. Chandran, B.G., Hochbaum, D.S.: A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Oper. Res. 57(2), 358–376 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fishbain, B., Hochbaum, D.S., Mueller, S.: Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems (2010). arXiv preprint arXiv: 1007.4531

  4. Fishbain, B., Hochbaum, D.S.: Hochbaum’s Pseudo-flow Matlab implementation (2012). http://riot.ieor.berkeley.edu/riot/Applications/Pseudoflow/maxflow.html. Accessed 15 June 2014

  5. Ford Jr., L.R., Fulkerson, D.R.: A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Can. J. Math. 9, 210–218 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  6. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. J. ACM 35, 921–940 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hochbaum, D.S.: The pseudoflow algorithm: A new algorithm for the maximum flow problem. Oper. Res. 56(4), 992–1009 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jaynes, E.T.: Information theory and statistical mechanics. Phys. Rev. 106, 620–630 (1957a)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jaynes, E.T.: Information theory and statistical mechanics II. Phys. Rev. 108, 171–190 (1957b)

    Article  MathSciNet  MATH  Google Scholar 

  10. Joe, H.: Multivariate Models and Dependence Concepts. Chapman & Hall, London (1997)

    Book  MATH  Google Scholar 

  11. Kuichling, E.: The relation between the rainfall and the discharge of sewers in populous districts. Trans. Am. Soc. Civ. Eng. 20, 1–56 (1889)

    Google Scholar 

  12. King, V., Rao, S., Tarjan, R.: A faster deterministic maximum flow algorithm. J. Algorithms 17(3), 447–474 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  13. McCuen, R.: Hydrologic Analysis and Design, 2nd edn. New Jersey, Prentice-Hall Inc. (1998)

    Google Scholar 

  14. Nelsen, R.B.: An Introduction to Copulas, 2nd edn. Springer, New York (2006)

    MATH  Google Scholar 

  15. Poapongsakorn, N., Meethom, P.: Impact of the 2011 Floods, and Flood Management in Thailand. No. DP-2013-34 (2013)

    Google Scholar 

  16. Piantadosi, J., Howlett, P.G., Borwein, J.M.: Copulas with maximum entropy. Optim. Lett. 6, 99–125 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Piantadosi, J., Howlett, P.G., Borwein, J.M., Henstridge, J.: Maximum entropy methods for generating simulated rainfall. Numer. Algebra Control Optim. 2, 233–256 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Schrijver, A.: On the history of the transportation and maximum flow problem. Math. Program. 91, 437–445 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Suppaisarn, C.: Medium and heavy flood management in chao phraya river basin following the royal initiative. In: TRF Seminar (2011)

    Google Scholar 

  20. Sklar, A.: Fonctions de repartition a n dimensions et leurs marges. Publications de lInstitut de Statistique de lUniversite de Paris 8, 229–231 (1959)

    MathSciNet  MATH  Google Scholar 

  21. Smith, D.K.: Networks and Graphs: Techniques and Computational Methods. Woodhead Publishing Limited, Sawston (2011)

    Google Scholar 

Download references

Acknowledgement(s)

The authors thank Prof. Dr. Hung T. Nguyen for his helpful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jirakom Sirisrisakulchai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Sirisrisakulchai, J., Harnpornchai, N., Autchariyapanitkul, K., Sriboonchitta, S. (2016). A Flood Risk Assessment Based on Maximum Flow Capacity of Canal System. In: Huynh, VN., Inuiguchi, M., Le, B., Le, B., Denoeux, T. (eds) Integrated Uncertainty in Knowledge Modelling and Decision Making. IUKM 2016. Lecture Notes in Computer Science(), vol 9978. Springer, Cham. https://doi.org/10.1007/978-3-319-49046-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49046-5_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49045-8

  • Online ISBN: 978-3-319-49046-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics