.png){kind=icon}
返回
A bacterial gene recombination algorithm for solving constrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.12.178.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Creature evolution manifests itself in the improved ability of species to adapt to their surroundings. Swarm intelligence and gene optimization are found in the population of interacting agents that are able to self-organize and self-strengthen. In this study, a new gene-based algorithm for constrained optimization problems is proposed and called bacterial gene recombination algorithm'' (BGRA). BGRA is inspired by the intelligent behavior of gene recombination in bacterial swarming. By referring to each phase of the well-regulated gene evolutionary process of bacteria, BGRA enables the exploration of problems and solution exploitation. For illustration, a set of constrained optimization problems are taken from the literature for testing purposes. In addition, satisfactory feasible solutions for constrained optimization problems were obtained by combining the BGRA and a penalty function method. Experimental results show that the proposed algorithm can yield near-optimal and stable solutions compared to the relevant literature, and thus, it can be an efficient alternative in the solving of constrained optimization problems. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Bacterial gene recombination algorithm
Penalty function
Constrained optimization problems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.5W
机构
暂无机构信息
引用论文
分享收藏Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏Leisure time physical activity and dementia risk: a dose-response meta-analysis of prospective studies.png)
BMJ Open
OAAI
BMJ OpenIF0
OAAI分享收藏分享收藏
查看更多内容