将不等长方形填入固定大小圆形的混合偏向遗传算法

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Qiang Luo, Yunqing Rao, Piaoruo Yang, Xusheng Zhao
{"title":"将不等长方形填入固定大小圆形的混合偏向遗传算法","authors":"Qiang Luo,&nbsp;Yunqing Rao,&nbsp;Piaoruo Yang,&nbsp;Xusheng Zhao","doi":"10.1016/j.cor.2024.106716","DOIUrl":null,"url":null,"abstract":"<div><p>This study addresses the two-dimensional circular knapsack packing problem, which packs unequal rectangles into a circular container to maximize the number or the area of items packed. A biased genetic algorithm hybridized with a local search algorithm is proposed to solve the problem. The algorithm has a powerful global searching ability and is responsible for exploration, and a local search is applied for exploitation. Therefore, the proposed approach has an excellent search ability that can balance intensification and diversification well. A decoding procedure is proposed to transform the chromosome into a packing layout. The procedure first produces several initial layouts that contain a few rectangles, forms a complete layout for each initial layout, and selects the best one as the final packing layout. Three new types of initial layouts are considered. A new set of evaluation rules for the placement position and a random selection method are proposed. Computational experiments using two benchmark datasets showed that the evolutionary algorithm could provide better solutions than state-of-the-art algorithms from the literature, with 64 new best solutions out of 108 benchmark instances.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid-biased genetic algorithm for packing unequal rectangles into a fixed-size circle\",\"authors\":\"Qiang Luo,&nbsp;Yunqing Rao,&nbsp;Piaoruo Yang,&nbsp;Xusheng Zhao\",\"doi\":\"10.1016/j.cor.2024.106716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This study addresses the two-dimensional circular knapsack packing problem, which packs unequal rectangles into a circular container to maximize the number or the area of items packed. A biased genetic algorithm hybridized with a local search algorithm is proposed to solve the problem. The algorithm has a powerful global searching ability and is responsible for exploration, and a local search is applied for exploitation. Therefore, the proposed approach has an excellent search ability that can balance intensification and diversification well. A decoding procedure is proposed to transform the chromosome into a packing layout. The procedure first produces several initial layouts that contain a few rectangles, forms a complete layout for each initial layout, and selects the best one as the final packing layout. Three new types of initial layouts are considered. A new set of evaluation rules for the placement position and a random selection method are proposed. Computational experiments using two benchmark datasets showed that the evolutionary algorithm could provide better solutions than state-of-the-art algorithms from the literature, with 64 new best solutions out of 108 benchmark instances.</p></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824001886\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824001886","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本研究解决的是二维圆形背包打包问题,即把不相等的矩形打包到圆形容器中,使打包物品的数量或面积最大化。研究提出了一种与局部搜索算法混合的偏向遗传算法来解决该问题。该算法具有强大的全局搜索能力,负责探索,并应用局部搜索进行利用。因此,所提出的方法具有出色的搜索能力,能很好地平衡集约化和多样化。建议采用解码程序将染色体转换为包装布局。该程序首先生成几个包含几个矩形的初始布局,为每个初始布局形成一个完整的布局,并选择最佳布局作为最终的包装布局。该程序考虑了三种新的初始布局类型。提出了一套新的放置位置评估规则和一种随机选择方法。使用两个基准数据集进行的计算实验表明,与文献中的先进算法相比,进化算法能提供更好的解决方案,在 108 个基准实例中获得了 64 个新的最佳解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid-biased genetic algorithm for packing unequal rectangles into a fixed-size circle

This study addresses the two-dimensional circular knapsack packing problem, which packs unequal rectangles into a circular container to maximize the number or the area of items packed. A biased genetic algorithm hybridized with a local search algorithm is proposed to solve the problem. The algorithm has a powerful global searching ability and is responsible for exploration, and a local search is applied for exploitation. Therefore, the proposed approach has an excellent search ability that can balance intensification and diversification well. A decoding procedure is proposed to transform the chromosome into a packing layout. The procedure first produces several initial layouts that contain a few rectangles, forms a complete layout for each initial layout, and selects the best one as the final packing layout. Three new types of initial layouts are considered. A new set of evaluation rules for the placement position and a random selection method are proposed. Computational experiments using two benchmark datasets showed that the evolutionary algorithm could provide better solutions than state-of-the-art algorithms from the literature, with 64 new best solutions out of 108 benchmark instances.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信