Abstract
This paper presents a modified Shuffled Frog Leaping Algorithm (SFLA) applied to the design of water distribution networks. Generally, one of the major disadvantages of the traditional SFLA is the high number of parameters that need to be calibrated for proper operation of the algorithm. A method for calibrating these parameters is presented and applied to the design of three benchmark medium-sized networks widely known in the literature (Hanoi, New York Tunnel, and GoYang). For each of the problems, over 35,000 simulations were conducted. Then, a statistical analysis was performed, and the relative importance of each of the parameters was analyzed to achieve the best possible configuration of the modified SFLA. The main conclusion from this study is that not all of the original SFL algorithm parameters are important. Thus, the fraction of frogs in the memeplex q can be eliminated, while the other parameters (number of evolutionary steps Ns, number of memeplexes m, and number of frogs n) may be set to constant values that run optimally for all medium-sized networks. Furthermore, the modified acceleration parameter C becomes the key parameter in the calibration process, vastly improving the results provided by the original SFLA.
Highlights
The problem of determining the pipe diameters in a water distribution network (WDN) to ensure minimum pressure levels at nodes is complex
This paper presents a modification of the classical Shuffled Frog Leaping Algorithm (SFLA) that has previously been used for mathematical problems but not applied to WDN design
An overview of the results showed that GoYang may be considered a simpler problem because
Summary
The problem of determining the pipe diameters in a water distribution network (WDN) to ensure minimum pressure levels at nodes is complex. Due to the complexity of the problem, the design, expansion, or rehabilitation of WDNs has traditionally been based on engineering experience. During the last three decades, many researchers have focused their efforts on the development of different optimization methodologies for the design of water networks, with the cost of the network as an objective function to be optimized. Researchers used linear programming to optimize a pipe design. This method involves an approach that reduces the complexity of the original nonlinear problem by solving a sequence of approximate linear sub problems. The original approach network [1]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
