求解同一装箱问题的混合递归算法

2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS) Pub Date : 2022-10-21 DOI:10.1109/ICSESS54813.2022.9930183

Yanming Ye, Yaru Su

{"title":"求解同一装箱问题的混合递归算法","authors":"Yanming Ye, Yaru Su","doi":"10.1109/ICSESS54813.2022.9930183","DOIUrl":null,"url":null,"abstract":"To solve identical cuboid bin packing problem, a recursive algorithm combining with the idea of combination block is proposed. The experimental results show that the average space utilization of the algorithm on target data set can reach 99.88% that is better than other algorithms.","PeriodicalId":265412,"journal":{"name":"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hybrid Recursive Algorithm to Solving the Identical Bin Packing Problem\",\"authors\":\"Yanming Ye, Yaru Su\",\"doi\":\"10.1109/ICSESS54813.2022.9930183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve identical cuboid bin packing problem, a recursive algorithm combining with the idea of combination block is proposed. The experimental results show that the average space utilization of the algorithm on target data set can reach 99.88% that is better than other algorithms.\",\"PeriodicalId\":265412,\"journal\":{\"name\":\"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS54813.2022.9930183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS54813.2022.9930183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

针对同长方体装箱问题，提出了一种结合组合块思想的递归算法。实验结果表明，该算法在目标数据集上的平均空间利用率可达99.88%，优于其他算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Hybrid Recursive Algorithm to Solving the Identical Bin Packing Problem

To solve identical cuboid bin packing problem, a recursive algorithm combining with the idea of combination block is proposed. The experimental results show that the average space utilization of the algorithm on target data set can reach 99.88% that is better than other algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2022 IEEE 13th International Conference on Software Engineering and Service Science (ICSESS)

自引率

0.00%

发文量