Dynamic hierarchical parallel constrained optimization evolutionary algorithm
Zou Mu-chun · Jisuanji yingyong yanjiu · 2011
This paper proposed dynamic hierarchical parallel evolutionary algorithm for solving constrained optimization problems.In this approach,introduced the individuals generation based on good-point-set method into the evolutionary algorithm initial step.During the evolution process,divided the initial population into two subpopulations,which were employed for global and local search respectively.Hierarchical ways of parallel variables were dynamically adapted according to the different search phases.The proposed algorithm was tested on six well-known constrained optimization problems,and the experiment results show the feasibility and effectiveness of the method.