.png){kind=icon}
返回
An improved genetic algorithm based on a novel selection strategy for nonlinear programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2010.06.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Genetic algorithm is a heuristic population-based search method that incorporates three primary operators: crossover, mutation and selection. Selection operator plays a crucial role in finding optimal solution for constrained optimization problems. In this paper, an improved genetic algorithm (IGA) based on a novel selection strategy is presented to handle nonlinear programming problems. Each individual in selection process is represented as a three-dimensional feature vector composed of objective function value, the degree of constraints violations and the number of constraints violations. We can distinguish excellent individuals through two indices according to Pareto partial order. Additionally, IGA incorporates a local search (LS) process into selection operation so as to find feasible solutions located in neighboring areas of some infeasible solutions. Experimental results over a set of benchmark problems demonstrate that proposed IGA has better robustness, effectiveness and stableness than other algorithm reported in literature. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Genetic algorithms
Nonlinear programming problems
Constraint-handling
Non-dominated solution
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems求解混合整数非线性规划问题的进化算法方法
.png){kind=icon}
PREAI
分享收藏
分享收藏A Preliminary Study on the Effect of Ethyl Oleate Dipping Treatment on Drying Rate of Grain Corn
PREAI
分享收藏Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏
查看更多内容