Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Optimal design of water distribution networks by a discrete state transition algorithm|
|Citation:||Engineering Optimization, 2016; 48(4):603-628|
|Publisher:||Taylor & Francis|
|Xiaojun Zhou, David Y. Gao & Angus R. Simpson|
|Abstract:||In this study it is demonstrated that, with respect to model formulation, the number of linear and nonlinear equations involved in water distribution networks can be reduced to the number of closed simple loops. Regarding the optimization technique, a discrete state transition algorithm (STA) is introduced to solve several cases of water distribution networks. Firstly, the focus is on a parametric study of the ‘restoration probability and risk probability’ in the dynamic STA. To deal effectively with head pressure constraints, the influence is then investigated of the penalty coefficient and search enforcement on the performance of the algorithm. Based on the experience gained from training the Two-Loop network problem, a discrete STA has successfully achieved the best known solutions for the Hanoi, triple Hanoi and New York network problems.|
|Keywords:||discrete state transition algorithm; water distribution network; intelligent optimization; NP-hardness|
|Rights:||© 2015 Taylor & Francis|
|Appears in Collections:||Aurora harvest 3|
Civil and Environmental Engineering publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.