Use of Domain Knowledge to Increase the Convergence Rate of Evolutionary Algorithms for Optimizing the Cost and Resilience of Water Distribution Systems

被引:24
作者
Bi, Weiwei [1 ]
Dandy, Graeme C. [2 ]
Maier, Holger R. [2 ]
机构
[1] Univ Adelaide, Sch Civil Environm & Min, Adelaide, SA 5005, Australia
[2] Univ Adelaide, Environm & Min Engn, Adelaide, SA 5005, Australia
关键词
Multiobjective evolutionary algorithm; Optimization; Initialization method; Water distribution system; Near-optimal fronts; MULTIOBJECTIVE OPTIMIZATION; GENETIC ALGORITHM; RELIABILITY;
D O I
10.1061/(ASCE)WR.1943-5452.0000649
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Evolutionary algorithms (EAs) have been used extensively for the optimization of water distribution systems (WDSs) over the last two decades. However, computational efficiency can be a problem, especially when EAs are applied to complex problems that have multiple competing objectives. In order to address this issue, there has been a move toward developing EAs that identify near-optimal solutions within acceptable computational budgets, rather than necessarily identifying globally optimal solutions. This paper contributes to this work by developing and testing a method for identifying high-quality initial populations for multiobjective EAs (MOEAs) for WDS design problems aimed at minimizing cost and maximizing network resilience. This is achieved by considering the relationship between pipe size and distance to the source(s) of water, as well as the relationship between flow velocities and network resilience. The benefit of using the proposed approach compared with randomly generating initial populations in relation to finding near-optimal solutions more efficiently is tested on five WDS optimization case studies of varying complexity with two different MOEAs. The results indicate that there are considerable benefits in using the proposed initialization method in terms of being able to identify near-optimal solutions more quickly. These benefits are independent of MOEA type and are more pronounced for larger problems and smaller computational budgets.
引用
收藏
页数:12
相关论文
共 41 条
[1]  
[Anonymous], 2012, C EVOL COMPUT, DOI DOI 10.1162/EVCO_A_00075
[2]   Improved genetic algorithm optimization of water distribution system design by incorporating domain knowledge [J].
Bi, W. ;
Dandy, G. C. ;
Maier, H. R. .
ENVIRONMENTAL MODELLING & SOFTWARE, 2015, 69 :370-381
[3]   Fast network multi-objective design algorithm combined with an a posteriori procedure for reliability evaluation under various operational scenarios [J].
Creaco, E. ;
Franchini, M. .
URBAN WATER JOURNAL, 2012, 9 (06) :385-399
[4]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[5]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[6]   Relationship between problem characteristics and the optimal number of genetic algorithm generations [J].
Gibbs, M. S. ;
Maier, H. R. ;
Dandy, G. C. .
ENGINEERING OPTIMIZATION, 2011, 43 (04) :349-376
[7]   A genetic algorithm calibration method based on convergence due to genetic drift [J].
Gibbs, Matthew S. ;
Dandy, Graeme C. ;
Maier, Holger R. .
INFORMATION SCIENCES, 2008, 178 (14) :2857-2869
[8]   Using characteristics of the optimisation problem to determine the Genetic Algorithm population size when the number of evaluations is limited [J].
Gibbs, Matthew S. ;
Maier, Holger R. ;
Dandy, Graeme C. .
ENVIRONMENTAL MODELLING & SOFTWARE, 2015, 69 :226-239
[9]   Large-scale parallelization of the Borg multiobjective evolutionary algorithm to enhance the management of complex environmental systems [J].
Hadka, David ;
Reed, Patrick .
ENVIRONMENTAL MODELLING & SOFTWARE, 2015, 69 :353-369
[10]   Diagnostic Assessment of Search Controls and Failure Modes in Many-Objective Evolutionary Optimization [J].
Hadka, David ;
Reed, Patrick .
EVOLUTIONARY COMPUTATION, 2012, 20 (03) :423-452