ABSTRACT

A novel heuristic method for the optimal design of a looped Water Distribution Network (WDN) is proposed. The method is based on the determination of optimal paths that water will follow in a WDN. The new method does not have any parameters that need to be adjusted and does not require a penalty function. It progresses by constantly updating an initial solution, while it gathers information from the neighboring search space. The optimization process is guided by two individual subroutines that universally and consecutively try targeted decreases of the diameters of the network pipe diameters, thus performing exploration and exploitation of the search space. The algorithm is applied to three benchmark networks to demonstrate its effectiveness and efficiency.

抽象的

提出了一种新颖的启发式方法，用于循环水分配网络（WDN）的优化设计。该方法基于确定水在WDN中遵循的最佳路径。新方法没有任何需要调整的参数，并且不需要惩罚函数。它通过不断更新初始解决方案来进行，同时它从相邻的搜索空间中收集信息。优化过程由两个单独的子程序进行指导，这两个子程序普遍且连续地尝试有针对性地减小网管直径的直径，从而进行搜索空间的探索和开发。该算法被应用于三个基准网络，以证明其有效性和效率。