Please use this identifier to cite or link to this item:
|Title:||Superior exploration-exploitation balance in shuffled complex evolution|
|Authors:||Muttil, N. |
|Citation:||Muttil, N., Liong, S.-Y. (2004-12). Superior exploration-exploitation balance in shuffled complex evolution. Journal of Hydraulic Engineering 130 (12) : 1202-1205. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)0733-9429(2004)130:12(1202)|
|Abstract:||Numerous applications within water resources require a robust and efficient optimization algorithm. Given that these applications involve multimodal nonconvex and discontinuous search spaces, evolutionary algorithms (EAs)-which are known to possess global optimization properties-have been widely used for this purpose. For an evolutionary algorithm to be successful, two important facets of the search-exploration and exploitation of the search space-need to be addressed. In this study, we address the issue of achieving a superior exploration-exploitation tradeoff in an extensively used EA, the shuffled complex evolution (SCE-UA). A scheme to improve the exploration capability of the SCE-UA in finding the global optimum is suggested. The scheme proposed a systematically located initial population instead of a randomly generated one used in SCE-UA. On a suite of commonly used test functions, the robustness and efficiency of the modified SCE-UA algorithm was compared with the original SCE-UA. It is observed that when the points in the initial population are strategically placed, it leads to better exploration of the search space, and hence, yields a superior balance between exploration and exploitation. This in turn results in a significant improvement in the robustness of the SCE-UA algorithm. © ASCE.|
|Source Title:||Journal of Hydraulic Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2019
WEB OF SCIENCETM
checked on Jan 7, 2019
checked on Dec 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.