Global Optimization Accuracy and Evolutionary Dynamics of the Generalized Generation Gap Algorithm with Adaptive Mutation

Main Article Content

Jason Teo

Abstract

The Generalized Generation Gap (G3) algorithm is one of the most efficient and effective state-of-the-art real-coded genetic algorithms (RCGAs) for unconstrained global optimization. However, its performance on multimodal optimization problems is known to be poor compared to unimodal optimization problems. The G3 algorithm currently relies on crossover operations only. The objective of this paper is to augment the G3 algorithm with adaptive mutation operations which are dynamically activated according to some explicit feedback during the evolutionary optimization process in order to improve its performance for solving multimodal optimization problems. The performance of the enhanced algorithm is compared with its original version based on the global optimization accuracy and the evolutionary dynamics of the optimization process. The proposed algorithm is tested using five benchmark test problems with highly deceptive fitness landscapes. It was found that the performance of the G3 algorithm with adaptive mutation improved significantly in two of the five test problems. In one of these test problems, no optimal solutions could be found previously by the G3 algorithm but can now be solved by the proposed G3 algorithm with augmented adaptive mutation operations.

Downloads

Download data is not yet available.

Article Details

How to Cite
Teo, J. (2006). Global Optimization Accuracy and Evolutionary Dynamics of the Generalized Generation Gap Algorithm with Adaptive Mutation. Malaysian Journal of Computer Science, 19(2), 159–167. Retrieved from https://jupidi.um.edu.my/index.php/MJCS/article/view/6283
Section
Articles