location: Current position: Home >> Scientific Research >> Paper Publications

Iterative dynamic diversity evolutionary algorithm for constrained optimization

Hits:

Indexed by:期刊论文

Date of Publication:2014-11-01

Journal:Zidonghua Xuebao/Acta Automatica Sinica

Included Journals:EI、PKU、ISTIC

Volume:40

Issue:11

Page Number:2469-2479

ISSN No.:02544156

Abstract:Evolutionary algorithms (EAs) were shown to be effective for complex constrained optimization problems. However, inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions. In this paper, we propose an iterative dynamic diversity evolutionary algorithm (IDDEA) with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps. In IDDEA, a novel optimum estimation strategy with multi-agents evolving diversely is suggested to efficiently compute dominance trend and establish a subregion. In addition, a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration, which is based on a special dominance estimation scheme. Meanwhile, an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents. Furthermore, several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.

Pre One:区间时变时滞系统的时滞相关稳定性分析

Next One:Global convergence property of iterative learning control algorithm based on damped newton-method