An Improved Dynamical Evolutionary Algorithm and Its Application

The dynamical evolutionary algorithm is that all individuals in a population (called as particles in a dynamical system) are running and searching along with their population evolving driven by a new select mechanism. In this paper, rank-based selection is proposed for the dynamical evolutionary algorithm. The method applies rank-based selection to replace half of the lower fitness population with the higher fitness population of the dynamical system. In order to verify the effectiveness of our scheme, we apply IDEA to solve some typical numerical function minimization problems. The experimental results show that IDEA is fast and reliable.