Comparative Study between the Improved Implementation of 3 Classic Mutation Operators for Genetic Algorithms

被引:10
作者
Cazacu, Razvan [1 ]
机构
[1] Petru Maior Univ, Nicolae Iorga 1, Targu Mures 540088, Romania
来源
10TH INTERNATIONAL CONFERENCE INTERDISCIPLINARITY IN ENGINEERING, INTER-ENG 2016 | 2017年 / 181卷
关键词
Genetic Algorithm; Uniform Mutation; Polynomial Mutation; Gaussian Mutation; performance comparison; MATLAB; OOGA; DESIGN;
D O I
10.1016/j.proeng.2017.02.444
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Mutation is the most important Genetic Algorithms operator, allowing them to thoroughly explore the design space of an optimization problem. If designed correctly it also allows for the exploitation of promising solutions, task usually attributed to crossover. This study compares the performance of three classic mutation operators: uniform, polynomial and Gaussian. The tool used is the OOGA framework which implements an improved and unified variant of the mutation operators. GA performance is evaluated on a benchmark structural optimization problem using three criteria: accuracy, reliability and efficiency. The optimum configuration of each operator is also explored by varying mutation parameters over a range of possible values. Overall the study is aimed at the optimization practitioners, offering them the means to make informed decisions about the right mutation operator and its setting for particular problems. (C) 2017 The Authors. Published by Elsevier Ltd.
引用
收藏
页码:634 / 640
页数:7
相关论文
共 15 条
[1]  
[Anonymous], 2008, Soft Computing
[2]   Evolution strategies – A comprehensive introduction [J].
Hans-Georg Beyer ;
Hans-Paul Schwefel .
Natural Computing, 2002, 1 (1) :3-52
[3]  
Cazacu R., 2015, THESIS
[4]   Steel truss optimization using genetic algorithms and FEA [J].
Cazacu, Razvan ;
Grama, Lucian .
7TH INTERNATIONAL CONFERENCE INTERDISCIPLINARITY IN ENGINEERING (INTER-ENG 2013), 2014, 12 :339-346
[5]   Design of truss-structures for minimum weight using genetic algorithms [J].
Deb, K ;
Gulati, S .
FINITE ELEMENTS IN ANALYSIS AND DESIGN, 2001, 37 (05) :447-465
[6]  
Deb K., 2001, MULTIOBJECTIVE OPTIM, V16
[7]   A new mutation operator for real coded genetic algorithms [J].
Deep, Kusum ;
Thakur, Manoj .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 193 (01) :211-230
[8]   Design of an adaptive mutation operator in an electrical load management case study [J].
Gomes, A. ;
Antunes, C. Henggeler ;
Martins, A. Gomes .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2925-2936
[9]  
Hinterding R, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, P384, DOI 10.1109/ICEC.1995.489178
[10]   A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms [J].
Mateo, P. M. ;
Alberto, I. .
JOURNAL OF HEURISTICS, 2012, 18 (01) :53-89