A Novel Hybrid Genetic Algorithm for Unconstrained and Constrained Function Optimization

Rajashree Mishra, K. Das
{"title":"A Novel Hybrid Genetic Algorithm for Unconstrained and Constrained Function Optimization","authors":"Rajashree Mishra, K. Das","doi":"10.4018/978-1-5225-2375-8.CH009","DOIUrl":null,"url":null,"abstract":"During the past decade, academic and industrial communities are highly interested in evolutionary techniques for solving optimization problems. Genetic Algorithm (GA) has proved its robustness in solving all most all types of optimization problems. To improve the performance of GA, several modifications have already been done within GA. Recently GA has been hybridized with many other nature-inspired algorithms. As such Bacterial Foraging Optimization (BFO) is popular bio inspired algorithm based on the foraging behavior of E. coli bacteria. Many researchers took active interest in hybridizing GA with BFO. Motivated by such popular hybridization of GA, an attempt has been made in this chapter to hybridize GA with BFO in a novel fashion. The Chemo-taxis step of BFO plays a major role in BFO. So an attempt has been made to hybridize Chemo-tactic step with GA cycle and the algorithm is named as Chemo-inspired Genetic Algorithm (CGA). It has been applied on benchmark functions and real life application problem to prove its efficacy.","PeriodicalId":345892,"journal":{"name":"Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/978-1-5225-2375-8.CH009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

During the past decade, academic and industrial communities are highly interested in evolutionary techniques for solving optimization problems. Genetic Algorithm (GA) has proved its robustness in solving all most all types of optimization problems. To improve the performance of GA, several modifications have already been done within GA. Recently GA has been hybridized with many other nature-inspired algorithms. As such Bacterial Foraging Optimization (BFO) is popular bio inspired algorithm based on the foraging behavior of E. coli bacteria. Many researchers took active interest in hybridizing GA with BFO. Motivated by such popular hybridization of GA, an attempt has been made in this chapter to hybridize GA with BFO in a novel fashion. The Chemo-taxis step of BFO plays a major role in BFO. So an attempt has been made to hybridize Chemo-tactic step with GA cycle and the algorithm is named as Chemo-inspired Genetic Algorithm (CGA). It has been applied on benchmark functions and real life application problem to prove its efficacy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的无约束和约束函数优化的混合遗传算法
在过去的十年中,学术界和工业界对解决优化问题的进化技术非常感兴趣。遗传算法在求解几乎所有类型的优化问题方面具有较强的鲁棒性。为了提高遗传算法的性能,已经对遗传算法进行了一些修改。最近,遗传算法与许多其他受自然启发的算法混合在一起。因此,细菌觅食优化(BFO)是一种基于大肠杆菌觅食行为的流行的仿生算法。许多研究者对转基因与BFO的杂交研究产生了积极的兴趣。在这种流行的遗传算法杂交的激励下,本章尝试以一种新颖的方式将遗传算法与BFO杂交。BFO的Chemo-taxis步骤在BFO中起主要作用。为此,本文尝试将化学策略步骤与遗传算法周期相结合,并将该算法命名为化学启发遗传算法(CGA)。通过对基准函数和实际应用问题的分析,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Approach for Business Process Model Matching Using Genetic Algorithms A Modified Kruskal's Algorithm to Improve Genetic Search for Open Vehicle Routing Problem Missing Value Imputation Using ANN Optimized by Genetic Algorithm Optimization of Windspeed Prediction Using an Artificial Neural Network Compared With a Genetic Programming Model The Genetic Algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1