Population size influence on the efficiency of evolutionary algorithms to design water networks

Abstract

[EN] The optimal sizing in water distribution networks (WDN) is of great interest because it allows the selection of alternative economical solutions that ensure design requirements at nodes (demands and pressure) and at lines (velocities). Among all the available design methodologies, this work analyzes those based on evolutionary algorithms (EAs). EAs are a combination of deterministic and random approaches, and the performance of the algorithm depends on the searching process. Each EA features specific parameters, and a proper calibration helps to reduce the randomness factor and improves the effectiveness of the search for minima. More specifically, the only common parameter to all techniques is the initial size of the random population (P). It is well known that population size should be large enough to guarantee the diversity of solutions and must grow with the number of decision variables. However, the larger the population size, the slower the convergence process. This work attempts to determine the population size that yields better solutions in less time. In order to get that, the work applies a method based on the concept of efficiency (E) of an algorithm. This efficiency relates the quality of the obtained solution with the computational effort that every EA requires to find the final design solution. This ratio E also represents an objective indicator to compare the performance of different algorithms applied to WDN optimization. The proposed methodology is applied to the pipe-sizing problem of three medium-sized benchmark networks, such as Hanoi, New York Tunnel and GoYang networks. Thus, from the currently available algorithms, this work includes evolutionary methodologies based on a Pseudo-Genetic Algorithm (PGA), Particle Swarm Optimization (PSO) and Harmony Search (HS). First, the different algorithm parameters for each network are calibrated. The values used for every EA are those that have been calculated in previous works. Secondly, specific parameters remain constant and the population size is modified. After more than 500,000 simulations, the influence of the population size is statistically analyzed in the final solutions. Finally, the efficiency was analyzed for each network and algorithm. The results ensure the best possible configuration based on the quality of the solutions and the convergence speed of the algorithm, depending of the population size.