Skip to main content
SpringerLink
Log in

An available-flow neural network for solving the dynamic groundwater network maximum flow problem

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The normal operation of infrastructure networks such as groundwater networks maintains people’s life and work. Therefore, it is of great significance to estimate the residual flow when these networks are damaged to evaluate their anti-risk ability. This paper abstracts these problems as the damage-network time-varying maximum flow problem (DTMFP), where the arc capacity in the network is set as a time-varying function. Since the water network is subject to electric-driven periodic changes, the network damage is defined by some arcs or nodes in the network doesn’t work at all. Although the existing maximum flow algorithms such as Cai-Sha can solve the time-varying maximum flow problem, the uncertainty of the network topology that suffers from random damage makes it difficult for the existing maximum flow algorithms to solve such problems. The uncertainty of network topology which suffer random damage makes such problems difficult to solve by existing maximum flow algorithms. Therefore, the key to solve DTMFPs is to find the topology of damaged network. In this paper, we propose an available flow neural network (AFNN) algorithm for solving DTMFPs. The idea of the AFNN algorithm is to determine the network topology through the back-information neural networks (BINN) algorithm at first, then obtain the residual maximum flow through the single-path neural networks (SPNN) algorithm. In the BINN algorithm, the departure node is continuously activated for a given time period and sends waves along the network to the destination node. The wave contains arcs which can be activated. The Utah channel impact response wireless sensor network, American north marin water district network and New York road network are used to confirm the effectiveness of the proposed AFNN algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Data Availability

The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.

References

  • Faramondi L, Oliva G, Setola R (2020) Multi-criteria node criticality assessment framework for critical infrastructure networks. Int J Crit Infrastruct Prot 28:1–14

    Article  Google Scholar 

  • Weber R, Huzsvar T, Hos C (2020) Vulnerability analysis of water distribution networks to accidental pipe burst. Water Res 184:1–11

    Article  Google Scholar 

  • Yazdani A, Jeffrey P (2012) Water distribution system vulnerability analysis using weighted and directed network models. Water Resour Res 48:1–10

    Article  Google Scholar 

  • Kong J, Simonovic SP, Zhang C (2019) Resilience assessment of interdependent infrastructure systems: a case study based on different response strategies. Sustainability 11:1–31

    Article  Google Scholar 

  • Tornyeviadzi HM, Mohammed H, Seidu R (2022) Dynamic segment criticality analysis: a precursor to scheduling of maintenance routines in water distribution networks. Alexand Eng J 61(12):9261–9272

    Article  Google Scholar 

  • Zhang Y, Li Z, Aviso KB, Jia X, Zhang P, Tan RR, Klemes JJ, Wang F, Jia X (2022) Industrial water network vulnerability analysis using dynamic inoperability input-output model. J Environ Manag 314:1–10

    Article  Google Scholar 

  • Tornyeviadzi HM, Owusu-Ansah E, Mohammed H, Seidu R (2022) A systematic framework for dynamic nodal vulnerability assessment of water distribution networks based on multilayer networks. Reliab Eng Syst Safety 219:1–13

    Article  Google Scholar 

  • Tornyeviadzi HM, Neba FA, Mohammed H, Seidu R (2021) Nodal vulnerability assessment of water distribution networks: an integrated Fuzzy AHP-TOPSIS approach. Int J Crit Infrastruct Protect 34:1–12

    Article  Google Scholar 

  • Shi Y, Zhang D, Diao Z (2018) in Proc. 2018 IEEE 3rd international conference on big data analysis (ICBDA), Shanghai, China,1-5

  • Wang W, Zhang Y, Li Y, Hu Q, Liu C, Liu C (2022) Vulnerability analysis method based on risk assessment for gas transmission capabilities of natural gas pipeline networks. Reliab Eng Syst Safety 218:1–12

    Article  Google Scholar 

  • Jiang Y, Wang Y, Szetoc WY, Chow AHF, Nagurney A (2021) Probabilistic assessment of transport network vulnerability with equilibrium flows. Int J Sustain Transportat 15(7):512–523

    Article  Google Scholar 

  • Chen Y, Zhu J, Wan L, Fang X, Tong F, Xu X (2022) Routing failure prediction and repairing for AUV-assisted underwater acoustic sensor networks in uncertain ocean environments. Appl Acoust 186:1–13

    Article  Google Scholar 

  • Chen Y, Yu W, Sun X, Wan L, Tao YI, Xu X (2021) Environment-aware communication channel quality prediction for underwater acoustic transmissions: a machine learning method. Appl Acoust 181:1–11

    Article  Google Scholar 

  • Rohit K, Venkanna U, Vivek T (2020) Opti-PUM: an optimal policy update mechanism for link failure prevention in mobile SDWM-IoT networks. IEEE Syst J 15(3):3427–3438

    Google Scholar 

  • Hu B, Tang W, Xie Q (2022) A two-factor security authentication scheme for wireless sensor networks in IoT environments. Neurocomputing 500:741–749

    Article  Google Scholar 

  • Bulut M, Özcan E (2021) Optimization of electricity transmission by Ford-Fulkerson algorithm. Sustain Energy Grids Net 28:1–6

    Google Scholar 

  • Takahashi T (2016) The Simplest and Smallest Network on Which the Ford-Fulkerson Maximum Flow Procedure May Fail to Terminate. Tech Rep Ieice Cst 24(2):390–394

  • Hamidan M, Borousan F (2022) Optimal planning of distributed generation and battery energy storage systems simultaneously in distribution networks for loss reduction and reliability improvement. J Energy Storage 46:1–18

    Article  Google Scholar 

  • Aalipour A, Kebriaei H, Ramezani M (2019) Analytical optimal solution of perimeter traffic flow control based on MFD dynamics: a pontryagin’s maximum principle approach. IEEE Trans Intell Transport Syst 20(9):3224–3234

    Article  Google Scholar 

  • Bauer D, Richter G, Asamer J, Heilmann B, Lenz G, Kolbl R (2018) Quasi-dynamic estimation of OD flows from traffic counts without prior OD matrix. IEEE Transactions on Intelligent Transportation Systems 19(6):2025–2034

    Article  Google Scholar 

  • Kara G, Zturan C (2019) Algorithm 1002: graph coloring based parallel push-relabel algorithm for the maximum flow problem. ACM Trans Math Soft 45(4):1–28

    Article  MathSciNet  Google Scholar 

  • Cai X, Sha D, Wong C (2021) Time-varying universal maximum flow problems. Math Comput Modell 33(4):407–430

    MathSciNet  MATH  Google Scholar 

  • Fathabadi HS, Hosseini SA (2010) Maximum flow problem on dynamic generative network flows with time-varying bound. Appl Math Modell 34(8):2136–2147

    Article  MathSciNet  MATH  Google Scholar 

  • Huang W, Zhang Y, Wan S (2022) A sorting fuzzy min-max model in an embedded system for atrial fibrillation detection. ACM Trans Multimed Comput Commun Appl. https://doi.org/10.1145/3554737

    Article  Google Scholar 

  • Huang W, Wang Y, Zhu L (2022) A time impulse neural network framework for solving the minimum path pair problems of the time-varying network. IEEE Trans Knowl Data Eng. https://doi.org/10.1109/TKDE.2022.3217394

    Article  Google Scholar 

  • Ding S (2015) The alpha-maximum flow model with uncertain capacities. Appl Math Modell 39(7):2056–2063

    Article  MATH  Google Scholar 

  • Effati S, Ranjbar M (2012) Neural network models for solving the maximum flow problem. Int J Adv Comput Sci Appl 8(6):159–164

    MATH  Google Scholar 

  • Sabbagh MS, Ghafari H, Mousav SR (2022) A new hybrid algorithm for the balanced transportation problem. Comput Indust Eng 82:115–126

    Article  Google Scholar 

Download references

Funding

This work was supported by the National Natural Science Foundation of China under Grant 62227805, supported by the Open Foundation of State Key Laboratory of Complex Electronic System Simulation, Beijing, China, under Grant 614201001032104, and supported by the National Key Research and Development Program of China under Grant 2022YFF0606904.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Tianjin University of Technology, Tianjin, 300382, China

    Baowen Zhang

  2. School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, 100081, China

    Wei Huang

  3. School of Computer Science and Technology, Beijing Institute of Technology, Beijing, 100081, China

    Fengnian Zhao

Authors
  1. Baowen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fengnian Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Huang.

Ethics declarations

Conflicts of interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, B., Huang, W. & Zhao, F. An available-flow neural network for solving the dynamic groundwater network maximum flow problem. Soft Comput (2023). https://doi.org/10.1007/s00500-023-07912-8

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00500-023-07912-8

Keywords

Search

Navigation