图压缩对解决二维带材切割问题的影响

2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC) Pub Date : 2021-12-20 DOI:10.1109/scc53769.2021.9768351

Mehdi Mrad, Tamer G. Ali, Ali Balma, A. Gharbi, Ali Samhan, M. Louly

{"title":"图压缩对解决二维带材切割问题的影响","authors":"Mehdi Mrad, Tamer G. Ali, Ali Balma, A. Gharbi, Ali Samhan, M. Louly","doi":"10.1109/scc53769.2021.9768351","DOIUrl":null,"url":null,"abstract":"We address the problematic of cutting m rectangular items from a two-dimensional strip. Each item has a given width, height, and demand. The purpose is to minimize the height of the used strip, while respecting the two stages of guillotine cuts. We consider the arc-flow formulation for this NP-hard problem and propose to enhance it using graph compression techniques. Computational results on real-world data show a consistently promising impact of the graph compression in terms of computation time and graph size.","PeriodicalId":365845,"journal":{"name":"2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Impact of Graph Compression on Solving the Two-Dimensional Strip Cutting Problem\",\"authors\":\"Mehdi Mrad, Tamer G. Ali, Ali Balma, A. Gharbi, Ali Samhan, M. Louly\",\"doi\":\"10.1109/scc53769.2021.9768351\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the problematic of cutting m rectangular items from a two-dimensional strip. Each item has a given width, height, and demand. The purpose is to minimize the height of the used strip, while respecting the two stages of guillotine cuts. We consider the arc-flow formulation for this NP-hard problem and propose to enhance it using graph compression techniques. Computational results on real-world data show a consistently promising impact of the graph compression in terms of computation time and graph size.\",\"PeriodicalId\":365845,\"journal\":{\"name\":\"2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/scc53769.2021.9768351\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/scc53769.2021.9768351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们解决了从二维条带上切割m个矩形项目的问题。每个物品都有给定的宽度、高度和需求。目的是尽量减少使用的高度，同时尊重两个阶段的断头台切割。我们考虑了这个np困难问题的弧流公式，并建议使用图压缩技术来增强它。在实际数据上的计算结果显示，在计算时间和图大小方面，图压缩具有一致的有希望的影响。

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

查看原文本刊更多论文

Impact of Graph Compression on Solving the Two-Dimensional Strip Cutting Problem

We address the problematic of cutting m rectangular items from a two-dimensional strip. Each item has a given width, height, and demand. The purpose is to minimize the height of the used strip, while respecting the two stages of guillotine cuts. We consider the arc-flow formulation for this NP-hard problem and propose to enhance it using graph compression techniques. Computational results on real-world data show a consistently promising impact of the graph compression in terms of computation time and graph size.

求助全文

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

来源期刊

2021 IEEE 2nd International Conference on Signal, Control and Communication (SCC)

自引率

0.00%

发文量