An efficient evolutionary programming algorithm using mixed mutation operators for numerical optimization

  • Authors:
  • Saif Ahmed;Md. Tanvir Alam Anik;K.M. Rakibul Islam

  • Affiliations:
  • Bangladesh University of Engineering & Technology, Dhaka, Bangladesh;Bangladesh University of Engineering & Technology, Dhaka, Bangladesh;Bangladesh University of Engineering & Technology, Dhaka, Bangladesh

  • Venue:
  • Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Evolutionary algorithms often suffer from premature convergence when dealing with complex multi-modal function optimization problems as the fitness landscape may contain numerous local optima. To avoid premature convergence, sufficient amount of genetic diversity within the evolving population needs to be preserved. In this paper we investigate the impact of two different categories of mutation operators on evolutionary programming in an attempt to preserve genetic diversity. Participation of the mutation operators on the evolutionary process is guided by fitness stagnation and localization information of the individuals. A simple experimental analysis has been shown to demonstrate the effectiveness of the proposed scheme over a test-suite of five classical benchmark functions