Efficiency of Evolutionary Algorithms in Water Network Pipe Sizing

被引:0
|
作者
D. Mora-Melia
P. L. Iglesias-Rey
F. J. Martinez-Solano
P. Ballesteros-Pérez
机构
[1] Universidad de Talca,Departamento de Ingeniería y Gestión de la Construcción, Facultad de Ingeniería
[2] Universitat Politècnica de Valencia,Departamento de Ingeniería Hidráulica y Medio Ambiente
来源
关键词
Evolutionary algorithms; Design; Water networks; Efficiency; Pipe sizing;
D O I
暂无
中图分类号
学科分类号
摘要
The pipe sizing of water networks via evolutionary algorithms is of great interest because it allows the selection of alternative economical solutions that meet a set of design requirements. However, available evolutionary methods are numerous, and methodologies to compare the performance of these methods beyond obtaining a minimal solution for a given problem are currently lacking. A methodology to compare algorithms based on an efficiency rate (E) is presented here and applied to the pipe-sizing problem of four medium-sized benchmark networks (Hanoi, New York Tunnel, GoYang and R-9 Joao Pessoa). E numerically determines the performance of a given algorithm while also considering the quality of the obtained solution and the required computational effort. From the wide range of available evolutionary algorithms, four algorithms were selected to implement the methodology: a PseudoGenetic Algorithm (PGA), Particle Swarm Optimization (PSO), a Harmony Search and a modified Shuffled Frog Leaping Algorithm (SFLA). After more than 500,000 simulations, a statistical analysis was performed based on the specific parameters each algorithm requires to operate, and finally, E was analyzed for each network and algorithm. The efficiency measure indicated that PGA is the most efficient algorithm for problems of greater complexity and that HS is the most efficient algorithm for less complex problems. However, the main contribution of this work is that the proposed efficiency ratio provides a neutral strategy to compare optimization algorithms and may be useful in the future to select the most appropriate algorithm for different types of optimization problems.
引用
收藏
页码:4817 / 4831
页数:14
相关论文
共 50 条
  • [11] ENGINEERING APPROACH TO WATER PIPE SIZING.
    Blank, John J.
    1600, (13):
  • [12] Multiobjective Approach for Water Distribution Network Design Combining Pipe Sizing and Isolation Valve Placement
    Mottahedin, Amirabbas
    Giudicianni, Carlo
    Cunha, Maria C.
    Creaco, Enrico
    JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT, 2024, 150 (10)
  • [13] A transgenetic algorithm for the gas network pipe sizing problem
    Goldbarg, E. E. G.
    Castro, M. P.
    Goldbarg, M. C.
    Computational Methods, Pts 1 and 2, 2006, : 893 - 904
  • [14] RELIABILITY OF ALGORITHMS FOR PIPE NETWORK ANALYSIS
    WOOD, DJ
    RAYES, AG
    JOURNAL OF THE HYDRAULICS DIVISION-ASCE, 1981, 107 (10): : 1145 - 1161
  • [15] Analysis on the Efficiency of Multifactorial Evolutionary Algorithms
    Huang, Zhengxin
    Chen, Zefeng
    Zhou, Yuren
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XVI, PT II, 2020, 12270 : 634 - 647
  • [16] Analog circuit sizing based on Evolutionary Algorithms and deep learning
    Lberni, Abdelaziz
    Marktani, Malika Alami
    Ahaitouf, Abdelaziz
    Ahaitouf, Ali
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 237
  • [17] Sensitivity Analysis in the Optimal Sizing of Analog ICs by Evolutionary Algorithms
    Guerra-Gomez, I.
    Tlelo-Cuautle, E.
    Gerardo de la Fraga, L.
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 3161 - 3165
  • [18] Simultaneous topology and sizing optimization of a water distribution network using a hybrid multiobjective evolutionary algorithm
    Bureerat, Sujin
    Sriworamas, Krit
    APPLIED SOFT COMPUTING, 2013, 13 (08) : 3693 - 3702
  • [19] PIPE SIZING
    WILLIAMS, JJ
    HYDROCARBON PROCESSING, 1967, 46 (09): : 112 - &
  • [20] Evaluation of evolutionary algorithms for the optimization of storm water drainage network for an urbanized area
    Satish Kumar
    D. R. Kaushal
    A. K. Gosain
    Acta Geophysica, 2019, 67 : 149 - 165