论文标题
一种新的无衍生线性线性近似,用于解决网络水流问题,并保证
A New Derivative-Free Linear Approximation for Solving the Network Water Flow Problem with Convergence Guarantees
论文作者
论文摘要
应对城市水基础设施系统的挑战,包括老化基础设施,供应不确定性,极端事件和安全威胁,很大程度上取决于供水网络建模,强调了逼真的假设,建模复杂性和可扩展解决方案的重要性。在这项研究中,我们提出了一个无衍生的线性近似,用于解决网络水流问题(WFP)。所提出的方法利用了非线性头部损耗方程的特殊形式,并且在变量和约束变化之后,WFP减少到线性优化问题,该问题可以通过现代线性求解器有效地解决。最终,提出的方法等于解决一系列线性优化问题。我们通过几个案例研究证明了提出的方法,并表明该方法可以对任意网络拓扑以及各种类型的阀门和泵进行建模,从而提供建模灵活性。在轻度条件下,我们表明提出的线性近似收敛。我们提供灵敏度分析并详细讨论我们方法的当前局限性,并提出解决这些方法以克服这些方法。所有代码,经过测试的网络和结果均可在GitHub上自由获得研究可重复性。
Addressing challenges in urban water infrastructure systems including aging infrastructure, supply uncertainty, extreme events, and security threats, depend highly on water distribution networks modeling emphasizing the importance of realistic assumptions, modeling complexities, and scalable solutions. In this study, we propose a derivative-free, linear approximation for solving the network water flow problem (WFP). The proposed approach takes advantage of the special form of the nonlinear head loss equations and, after the transformation of variables and constraints, the WFP reduces to a linear optimization problem that can be efficiently solved by modern linear solvers. Ultimately, the proposed approach amounts to solving a series of linear optimization problems. We demonstrate the proposed approach through several case studies and show that the approach can model arbitrary network topologies and various types of valves and pumps, thus providing modeling flexibility. Under mild conditions, we show that the proposed linear approximation converges. We provide sensitivity analysis and discuss in detail the current limitations of our approach and suggest solutions to overcome these. All the codes, tested networks, and results are freely available on Github for research reproducibility.