Optimization algorithm based on niche genetic algorithm for irregular nesting problem

L. Haiming, Zhou Jiong, Wu Xinsheng, Lu Jiaxiang
{"title":"Optimization algorithm based on niche genetic algorithm for irregular nesting problem","authors":"L. Haiming, Zhou Jiong, Wu Xinsheng, Lu Jiaxiang","doi":"10.1109/CCDC.2015.7162678","DOIUrl":null,"url":null,"abstract":"This paper presents an improved genetic algorithm based on niche strategy to solve the irregular nesting problem, which exists widely in modern manufacturing industry. For the niche strategy used in genetic algorithm, exclusion mechanism is introduced to avoid too many solutions with high similarity in the population, guaranteeing diversity of the solution set and preventing premature convergence of genetic search. No-fit polygon method based on Bottom-left strategy is used to evaluate the best placement position for every irregular part. Computational experiments based on data set published in the literature are taken to verify feasibility and effectiveness of the algorithm. The experiment results show that the proposed algorithm can be used to solve the nesting problem and generates some better solutions than the solutions published solutions for most examples.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 27th Chinese Control and Decision Conference (2015 CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2015.7162678","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents an improved genetic algorithm based on niche strategy to solve the irregular nesting problem, which exists widely in modern manufacturing industry. For the niche strategy used in genetic algorithm, exclusion mechanism is introduced to avoid too many solutions with high similarity in the population, guaranteeing diversity of the solution set and preventing premature convergence of genetic search. No-fit polygon method based on Bottom-left strategy is used to evaluate the best placement position for every irregular part. Computational experiments based on data set published in the literature are taken to verify feasibility and effectiveness of the algorithm. The experiment results show that the proposed algorithm can be used to solve the nesting problem and generates some better solutions than the solutions published solutions for most examples.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于小生境遗传算法的不规则嵌套问题优化算法
针对现代制造业中普遍存在的不规则嵌套问题,提出了一种基于小生境策略的改进遗传算法。在遗传算法的小生境策略中,引入排斥机制,避免种群中存在过多相似度高的解,保证解集的多样性,防止遗传搜索的过早收敛。采用基于左下策略的非拟合多边形法对每一个不规则零件进行最佳放置位置的求值。基于文献发表的数据集进行了计算实验,验证了算法的可行性和有效性。实验结果表明,该算法可用于解决嵌套问题,并且对大多数示例生成的解比已发布的解更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Application and design of attack and defense algorithms in WTN chess of computer games Research on calculating method of hidden layer nodes in BP network An improved GAFSA with adaptive step chaotic search The research on flywheel acceleration assessment with null motion escaping singularity for variable speed control moment gyros A multiple sub-models self-tuning control algorithm of non-uniformly sampled systems based on auxiliary-variable-model
×
引用
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