Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm

Yuxiang Shao, Hongwen Xu, Weiming Yin
{"title":"Solve Zero-One Knapsack Problem by Greedy Genetic Algorithm","authors":"Yuxiang Shao, Hongwen Xu, Weiming Yin","doi":"10.1109/IWISA.2009.5073116","DOIUrl":null,"url":null,"abstract":"In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the greedy algorithm with the genetic algorithm and formed the greedy genetic algorithm. The paper discussed the basic idea and method to solve the zero-one knapsack problem using this greedy genetic algorithm. The experiments prove the feasibility and validity of the algorithm.","PeriodicalId":6327,"journal":{"name":"2009 International Workshop on Intelligent Systems and Applications","volume":"33 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWISA.2009.5073116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the greedy algorithm with the genetic algorithm and formed the greedy genetic algorithm. The paper discussed the basic idea and method to solve the zero-one knapsack problem using this greedy genetic algorithm. The experiments prove the feasibility and validity of the algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用贪心遗传算法求解0 - 1背包问题
为了克服传统遗传算法的缺点,提高算法的速度和精度,作者改进了选择策略,将贪婪算法与遗传算法相结合,形成了贪婪遗传算法。本文讨论了利用贪心遗传算法求解0 - 1背包问题的基本思想和方法。实验证明了该算法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Intelligent Systems and Applications: Select Proceedings of ICISA 2022 Selecting Accurate Classifier Models for a MERS-CoV Dataset A Method of Same Frequency Interference Elimination Based on Adaptive Notch Filter Research on Work-in-Progress Control System of Integrating PI and SPC Study on A Novel Fuzzy PLL and Its Application
×
引用
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