Applications of Genetic Algorithm with Integrated Machine Learning

Arman Raj, Avneesh Kumar, Vandana Sharma, S. Rani, Ankit Kumar Shanu, Tanya Singh
{"title":"Applications of Genetic Algorithm with Integrated Machine Learning","authors":"Arman Raj, Avneesh Kumar, Vandana Sharma, S. Rani, Ankit Kumar Shanu, Tanya Singh","doi":"10.1109/ICIPTM57143.2023.10118328","DOIUrl":null,"url":null,"abstract":"The Meta heuristic algorithms are the higher level technique which helps to find the best feasible solution out of all possible solution of an optimization problem. There are various different types of meta heuristic algorithms like Ant Colony Optimization (ACO), Genetic Algorithm, Simulated Annealing, Particle Swarm Optimization, etc. Genetic Algorithm is a search-based optimization technique based on the biological principle of Genetics and adaptation. It is a meta-heuristic approach which is used to solve complex combinatorial problem. The integration of Genetic algorithm with machine learning will be helpful in solving unconstrained and constrained optimization problem. The various genetic operator like selection operator, mutation and cross-over are discussed which will be helpful in knowing how these operators significantly improves State Space search. In this paper the various applications of Genetic algorithms which can be used in machine learning has been discussed. In this paper the author discussed how the significance of Genetic algorithm will be improved while solving complex optimization problem in machine learning. In this paper, flow diagram of Genetic Algorithms has been discussed which will ease the understanding of complex optimization problem like 0–1 Knapsack, Traveling Salesman Problem, etc. In this paper a comparative analysis between traditional algorithm and genetic algorithm has been done on the basis of parameters like flow of control, state space search, Complication, Preconditions, CPU utilization etc. The various limitations of Genetic Algorithms in solving problems with optimal solutions has also been discussed.","PeriodicalId":178817,"journal":{"name":"2023 3rd International Conference on Innovative Practices in Technology and Management (ICIPTM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Innovative Practices in Technology and Management (ICIPTM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIPTM57143.2023.10118328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Meta heuristic algorithms are the higher level technique which helps to find the best feasible solution out of all possible solution of an optimization problem. There are various different types of meta heuristic algorithms like Ant Colony Optimization (ACO), Genetic Algorithm, Simulated Annealing, Particle Swarm Optimization, etc. Genetic Algorithm is a search-based optimization technique based on the biological principle of Genetics and adaptation. It is a meta-heuristic approach which is used to solve complex combinatorial problem. The integration of Genetic algorithm with machine learning will be helpful in solving unconstrained and constrained optimization problem. The various genetic operator like selection operator, mutation and cross-over are discussed which will be helpful in knowing how these operators significantly improves State Space search. In this paper the various applications of Genetic algorithms which can be used in machine learning has been discussed. In this paper the author discussed how the significance of Genetic algorithm will be improved while solving complex optimization problem in machine learning. In this paper, flow diagram of Genetic Algorithms has been discussed which will ease the understanding of complex optimization problem like 0–1 Knapsack, Traveling Salesman Problem, etc. In this paper a comparative analysis between traditional algorithm and genetic algorithm has been done on the basis of parameters like flow of control, state space search, Complication, Preconditions, CPU utilization etc. The various limitations of Genetic Algorithms in solving problems with optimal solutions has also been discussed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
遗传算法与集成机器学习的应用
元启发式算法是一种更高层次的技术,它有助于从优化问题的所有可能解中找到最佳可行解。有各种不同类型的元启发式算法,如蚁群优化(ACO),遗传算法,模拟退火,粒子群优化等。遗传算法是一种基于遗传和自适应生物学原理的基于搜索的优化技术。它是一种用于求解复杂组合问题的元启发式方法。遗传算法与机器学习的结合将有助于解决无约束和有约束优化问题。讨论了各种遗传算子,如选择算子、突变算子和交叉算子,这将有助于了解这些算子如何显著改善状态空间搜索。本文讨论了遗传算法在机器学习中的各种应用。本文讨论了遗传算法在解决机器学习中复杂优化问题时的意义。本文讨论了遗传算法的流程图,简化了对0-1背包、旅行商问题等复杂优化问题的理解。本文从控制流、状态空间搜索、复杂度、前提条件、CPU利用率等方面对传统算法和遗传算法进行了比较分析。本文还讨论了遗传算法在求解最优解问题中的各种局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High Efficiency class-F−1 Amplifier with reconfigurable microstrip Differential Filter for Sub-6-GHz Massive MIMO Application Predicting Student's Satisfaction towards Hybrid Learning in Informatics IoT based Weather, Soil, Earthquake, Air pollution Monitoring System Development of a Blockchain-based Platform to Simplify the Sharing of Patient Data A Silent Cardiac Atrial Fibrillation Detection and Classification using Deep Learning Approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1