.png){kind=icon}
返回
A modified real coded genetic algorithm for constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.02.093.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The performance of a genetic algorithm (GA) largely depends upon crossover and mutation operators. Deep and Thakur (2007) [14,15] proposed a real coded genetic algorithm (RCGA) incorporating Laplace crossover (LX) and power mutation (PM) operator and shown that the resulting GA (named LX-PM) outperforms many existing RCGAs on a large set of scalable test problems of varying difficulty level. In this paper, LX-PM is modified by improving the LX operator. The modified LX operator, named as bounded exponential crossover (BEX) operator, always creates offspring within the variable bounds. A new RCGA (named BEX-PM) incorporating BEX and PM operator is proposed. The performance of the modified GA is tested against the original algorithm LX-PM and three other popular constrained optimization algorithms (HX-NUM, HX-MPTM and SBX-POL) over a test suite containing twenty five constrained optimization problems collected from global optimization literature. The performance of all RCGAs and quality of solution obtained is compared on the basis of standard criteria used in GA literature. The comparative study shows that BEX-PM performs significantly better than the original algorithm LX-PM and outperforms all RCGAs considered in this study. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Real coded genetic algorithms
Laplace crossover
Power mutation
Constrained optimization
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Cyclin A-kinase regulation of E2F-1 DNA binding function underlies suppression of an S phase checkpoint.png)
Cell
OAAI
CellIF0
OAAI分享收藏Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏
查看更多内容