ALGORITMO GENÉTICO DE CHAVES ALEATÓRIAS VICIADAS ESPECIALIZADO PARA O PROBLEMA DE CORTE BIDIMENSIONAL NÃO GUILHOTINADO

Eliane Vendramini de Oliveira
{"title":"ALGORITMO GENÉTICO DE CHAVES ALEATÓRIAS VICIADAS ESPECIALIZADO PARA O PROBLEMA DE CORTE BIDIMENSIONAL NÃO GUILHOTINADO","authors":"Eliane Vendramini de Oliveira","doi":"10.5747/ce.2022.v14.e392","DOIUrl":null,"url":null,"abstract":"The Two-Dimensional Cutting Problem has a direct relationship with problems of industries. There are several proposals for solving this problem. In particular, solution proposals using metaheuristics were the focus of this research. Thus, in this paper we present a specialized genetic algorithm of randomized random keys. Several tests were performed using known instances in the specific literature, and the results found by the metaheuristic proposed were in many cases, equal or superior, to the results already published in the literature. Another comparative of results presented in this paper is related to the results obtained by the metaheuristic expert and results found by mathematical modeling using commercial software. In this case, again 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 cut without parts orientation.","PeriodicalId":30414,"journal":{"name":"Colloquium Exactarum","volume":"161 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Colloquium Exactarum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5747/ce.2022.v14.e392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Two-Dimensional Cutting Problem has a direct relationship with problems of industries. There are several proposals for solving this problem. In particular, solution proposals using metaheuristics were the focus of this research. Thus, in this paper we present a specialized genetic algorithm of randomized random keys. Several tests were performed using known instances in the specific literature, and the results found by the metaheuristic proposed were in many cases, equal or superior, to the results already published in the literature. Another comparative of results presented in this paper is related to the results obtained by the metaheuristic expert and results found by mathematical modeling using commercial software. In this case, again 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 cut without parts orientation.
针对非断头台二维切割问题的有缺陷随机键遗传算法
二维切割问题与工业问题有着直接的关系。解决这个问题有几个建议。特别是,使用元启发式的解决方案建议是本研究的重点。因此,本文提出了一种专门的随机密钥遗传算法。使用特定文献中的已知实例进行了几次测试,提出的元启发式发现的结果在许多情况下与文献中已经发表的结果相同或更好。本文提出的另一个结果的比较是与元启发式专家得到的结果和使用商业软件进行数学建模得到的结果有关。在这种情况下,遗传算法给出的结果等于或非常接近数学模型找到的最优值。此外,将优化方案扩展到无零件定向的二维非断头台切割。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
17
审稿时长
12 weeks
×
引用
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学术官方微信