A New Recurring Multistage Evolutionary Algorithm for Solving Problems Efficiently
This paper introduces a new approach, called recurring multistage evolutionary algorithm (RMEA), to balance the explorative and exploitative features of the conventional evolutionary algorithm. Unlike most previous work, the basis of RMEA is repeated and alternated executions of two different stages i.e. exploration and exploitation during evolution. RMEA uses dissimilar information across the population and similar information within population neighbourhood in mutation operation for achieving global exploration and local exploitation, respectively. It is applied on two unimodal, two multimodal, one rotated multimodal and one composition functions. The experimental results indicated the effectiveness of using different object-oriented stages and their repeated alternation during evolution. The comparison of RMEA with other algorithms showed its superiority on complex problems.
KeywordsEvolutionary algorithm exploration exploitation and optimization problem
Unable to display preview. Download preview PDF.
- 4.Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York (1995)Google Scholar
- 5.Gehlhaar, D.K., Fogel, D.B.: Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking. In: Proc. of the Fifth Annual Conference on Evolutionary Programming, pp. 419–429. MIT Press, Cambridge, MA (1996)Google Scholar
- 9.Liang, J.J., Suganthan, P.N., Deb, K.: Novel Composition Test Functions for Numerical Global Optimization. In: Proc. of IEEE Swarm Intelligence Symposium, pp. 68–75 (2005)Google Scholar
- 11.Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial arts: Towards Memetic Algorithms. Caltech Concurrent Computation Program, C3P Report 826 (1989)Google Scholar
- 13.Schlierkamp-Voosen, D., Mühlenbein, H.: Strategy Adaptation by Competing Subpopulations. Parallel Problem Solving from Nature 3, 199–208 (1994)Google Scholar