Genetic algorithm for bending process in sheet metal industry

C. Thanapandi, A. Walairacht, S. Ohara
{"title":"Genetic algorithm for bending process in sheet metal industry","authors":"C. Thanapandi, A. Walairacht, S. Ohara","doi":"10.1109/CCECE.2001.933571","DOIUrl":null,"url":null,"abstract":"In sheet metal industries, the required shape has to be bent from the flat 2D sheets. In this bending process, the most complex process is due to the determination of the bend sequence and assigning proper tools for each bend. Finding the best bending sequence is itself a combination problem and this when coupled with tool selection results in a combination explosion, which clearly states that an exhaustive approach is impossible to solve the problem in a time-economic way. Moreover since human operators handle the above operation, a process that is not complex, their desire have to be considered. A genetic algorithm is used to generate the bend sequence and tool selection for each bend. It finds a feasible solution based on collision detection, a simple process and the operator's desire. We present genetic algorithms for finding the best bending sequence and tool selection for each bent, based on collision avoidance and the operators desire, we discuss our new approach towards solving it, and the ideas being implemented and are evaluated using real part data.","PeriodicalId":184523,"journal":{"name":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Canadian Conference on Electrical and Computer Engineering 2001. Conference Proceedings (Cat. No.01TH8555)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.2001.933571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In sheet metal industries, the required shape has to be bent from the flat 2D sheets. In this bending process, the most complex process is due to the determination of the bend sequence and assigning proper tools for each bend. Finding the best bending sequence is itself a combination problem and this when coupled with tool selection results in a combination explosion, which clearly states that an exhaustive approach is impossible to solve the problem in a time-economic way. Moreover since human operators handle the above operation, a process that is not complex, their desire have to be considered. A genetic algorithm is used to generate the bend sequence and tool selection for each bend. It finds a feasible solution based on collision detection, a simple process and the operator's desire. We present genetic algorithms for finding the best bending sequence and tool selection for each bent, based on collision avoidance and the operators desire, we discuss our new approach towards solving it, and the ideas being implemented and are evaluated using real part data.
板料弯曲过程的遗传算法
在钣金工业中,需要的形状必须从平面的2D板材上弯曲。在这种弯曲过程中,最复杂的过程是由于弯曲顺序的确定和为每次弯曲分配合适的工具。寻找最佳弯曲顺序本身就是一个组合问题,当与工具选择相结合时,会导致组合爆炸,这清楚地表明,穷尽方法不可能以时间经济的方式解决问题。此外,由于人工操作员处理上述操作,这个过程并不复杂,因此必须考虑他们的愿望。采用遗传算法生成弯管顺序,并对每个弯管进行刀具选择。它基于碰撞检测、简单的过程和操作者的意愿找到了一种可行的解决方案。我们提出了基于避免碰撞和操作人员愿望的遗传算法,用于寻找最佳弯曲序列和每种弯曲的工具选择,我们讨论了解决它的新方法,以及正在实施的想法,并使用实际零件数据进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信