Crossover and mutation operators of genetic algorithms

Siew, Mooi Lim and Md. Sultan, Abu Bakar and Sulaiman, Md. Nasir and Mustapha, Aida and Leong, K. Y. (2017) Crossover and mutation operators of genetic algorithms. International Journal of Machine Learning and Computing, 7 (1). pp. 9-12. ISSN 2010-3700

Text AJ 2017 (515).pdf Restricted to Registered users only Download (603kB) | Request a copy

Abstract

Genetic algorithms (GA) are stimulated by population genetics and evolution at the population level where crossover and mutation comes from random variables. The problems of slow and premature convergence to suboptimal solution remain an existing struggle that GA is facing. Due to lower diversity in a population, it becomes challenging to locally exploit the solutions. In order to resolve these issues, the focus is now on reaching equilibrium between the explorative and exploitative features of GA. Therefore, the search process can be prompted to produce suitable GA solutions. This paper begins with an introduction, Section 2 describes the GA exploration and exploitation strategies to locate the optimum solutions. Section 3 and 4 present the lists of some prevalent mutation and crossover operators. This paper concludes that the key issue in developing a GA is to deliver a balance between explorative and exploitative features that complies with the combination of operators in order to produce exceptional performance as a GA as a whole.

Item Type:	Article
Uncontrolled Keywords:	Crossover operator; Mutation operator; Exploitation; Exploration
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Faculty of Applied Science and Technology > Department of Mathematics and Statistics
Depositing User:	Miss Nur Rasyidah Rosli
Date Deposited:	21 Nov 2021 07:11
Last Modified:	21 Nov 2021 07:11
URI:	http://eprints.uthm.edu.my/id/eprint/3688

Actions (login required)

View Item