A machine learning approach for automated strip packing algorithm selection

ORiON Pub Date : 2021-02-01 DOI:10.5784/36-2-686
Rosephine G. Rakotonirainy
{"title":"A machine learning approach for automated strip packing algorithm selection","authors":"Rosephine G. Rakotonirainy","doi":"10.5784/36-2-686","DOIUrl":null,"url":null,"abstract":"This paper deals with strip packing metaheuristic algorithm selection using data mining techniques. Given a set of solved strip packing problem instances, the relationship between the instance characteristics and algorithm performance is learned and is used to predict the best algorithms to solve a new set of unseen problem instances. A framework capable of modelling this relationship for an automated packing algorithm selection is proposed. The effectiveness of the proposed framework is evaluated in the context of a large set of strip packing problem instances and the state-of-the-art strip packing algorithms. The results suggest a 91% accuracy in correctly identifying the best algorithm for a given instance.","PeriodicalId":30587,"journal":{"name":"ORiON","volume":"27 1","pages":"73-88"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ORiON","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5784/36-2-686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper deals with strip packing metaheuristic algorithm selection using data mining techniques. Given a set of solved strip packing problem instances, the relationship between the instance characteristics and algorithm performance is learned and is used to predict the best algorithms to solve a new set of unseen problem instances. A framework capable of modelling this relationship for an automated packing algorithm selection is proposed. The effectiveness of the proposed framework is evaluated in the context of a large set of strip packing problem instances and the state-of-the-art strip packing algorithms. The results suggest a 91% accuracy in correctly identifying the best algorithm for a given instance.
一种基于机器学习的条带自动包装算法选择方法
本文研究了基于数据挖掘技术的条形包装元启发式算法选择。给定一组已解决的条形包装问题实例,学习实例特征与算法性能之间的关系,并用于预测解决一组新的未知问题实例的最佳算法。提出了一个能够对这种关系进行建模的框架,用于自动打包算法的选择。在大量条形布局问题实例和最先进的条形布局算法的背景下,评估了所提出框架的有效性。结果表明,在给定实例中正确识别最佳算法的准确率为91%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
11
×
引用
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学术官方微信