A new recurring multistage evolutionary algorithm for solving problems efficiently

Authors:
Md. Monirul Islam;Mohammad Shafiul Alam;Kazuyuki Murase
Affiliations:
Department of Computer Science and Engineering, Bangladesh Univ. of Engineering and Technology, Dhaka, Bangladesh and Department of Human and Artificial Intelligence Systems, Graduate School of En ...;Department of Computer Science and Engineering, Ahasanullah Univeristy of Science and Technology, Bangladesh;Department of Human and Artificial Intelligence Systems, Graduate School of Engineering, University of Fukui, Bunkyo, Fukui, Japan
Venue:
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Year:
2007

Citing 10
Cited 0

Evolutionary computation: toward a new philosophy of machine intelligence

Evolutionary computation: toward a new philosophy of machine intelligence
Intelligence through simulated evolution: forty years of evolutionary programming

Intelligence through simulated evolution: forty years of evolutionary programming
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Evolution strategies –A comprehensive introduction

Natural Computing: an international journal
Strategy Adaption by Competing Subpopulations

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Real-coded memetic algorithms with crossover hill-climbing

Evolutionary Computation - Special issue on magnetic algorithms
Combining mutation operators in evolutionary programming

IEEE Transactions on Evolutionary Computation
Evolutionary programming made faster

IEEE Transactions on Evolutionary Computation
Evolutionary programming using mutations based on the Levy probability distribution

IEEE Transactions on Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.