IMPROVED BIASED RANDOM KEY GENETIC ALGORITHM FOR THE TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM

Q4 Decision Sciences
Eliane Vendramini de Oliveira, R. Romero
{"title":"IMPROVED BIASED RANDOM KEY GENETIC ALGORITHM FOR THE TWO-DIMENSIONAL NON-GUILLOTINE CUTTING PROBLEM","authors":"Eliane Vendramini de Oliveira, R. Romero","doi":"10.1590/0101-7438.2022.042.00260406","DOIUrl":null,"url":null,"abstract":". The two-dimensional cutting problem has a direct relationship with industry problems. There are several proposals to solve these problems. In particular, solution proposals using metaheuristics are the focus of this research. Thus, in this paper, we present a specialized biased random key genetic algorithm. Several tests were performed using known instances in the specific literature, and the results found by the metaheuristics proposed were, in many cases, equal or superior to the results already published in the literature. Another comparison of results presented in this paper is related to the results obtained by specialized metaheuristics and the results found by a mathematical model using commercial software. Once again, in this case, the genetic algorithm presented results equal to or very close to the optimum found by the mathematical model. In addition, the optimization proposal was extended to two-dimensional non-guillotine cutting without parts orientation.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pesquisa Operacional","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1590/0101-7438.2022.042.00260406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 0

Abstract

. The two-dimensional cutting problem has a direct relationship with industry problems. There are several proposals to solve these problems. In particular, solution proposals using metaheuristics are the focus of this research. Thus, in this paper, we present a specialized biased random key genetic algorithm. Several tests were performed using known instances in the specific literature, and the results found by the metaheuristics proposed were, in many cases, equal or superior to the results already published in the literature. Another comparison of results presented in this paper is related to the results obtained by specialized metaheuristics and the results found by a mathematical model using commercial software. Once again, in this case, the genetic algorithm presented results equal to or very close to the optimum found by the mathematical model. In addition, the optimization proposal was extended to two-dimensional non-guillotine cutting without parts orientation.
二维非断头台切割问题的改进偏随机密钥遗传算法
. 二维切削问题与工业问题有着直接的关系。有几个建议可以解决这些问题。特别是,使用元启发式的解决方案建议是本研究的重点。因此,本文提出了一种特殊的偏置随机密钥遗传算法。使用特定文献中的已知实例进行了几次测试,在许多情况下,提出的元启发式发现的结果等于或优于文献中已经发表的结果。本文提出的另一种结果的比较是与专门的元启发式结果和使用商业软件的数学模型得到的结果有关。同样,在这种情况下,遗传算法给出的结果等于或非常接近数学模型找到的最优值。此外,将优化方案扩展到无零件定向的二维非断头台切削。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Pesquisa Operacional
Pesquisa Operacional Decision Sciences-Management Science and Operations Research
CiteScore
1.60
自引率
0.00%
发文量
19
审稿时长
8 weeks
期刊介绍: Pesquisa Operacional is published each semester by the Sociedade Brasileira de Pesquisa Operacional - SOBRAPO, performing one volume per year, and is distributed free of charge to its associates. The abbreviated title of the journal is Pesq. Oper., which should be used in bibliographies, footnotes and bibliographical references and strips.
×
引用
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学术官方微信