The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints
This paper tackles the 2-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. The problem asks for the cutting of a set of items with the minimum amount of raw material. The cutting patterns are subject to a number of constraints, including a new realistic constraint, regarding item...
Gespeichert in:
| Veröffentlicht in: | 2021 XLVII Latin American Computing Conference (CLEI) S. 1 - 9 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
25.10.2021
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper tackles the 2-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. The problem asks for the cutting of a set of items with the minimum amount of raw material. The cutting patterns are subject to a number of constraints, including a new realistic constraint, regarding item precedence, which has just been introduced in the literature. In this case, the items are organized in stacks, where each stack represents a customer request and defines the order in which the items must be cut. That is, if item i precedes item j within a stack, then i must be cut before j. However, there is no precedence constraint between items in different stacks. This constraint comes from applications where items must be stacked and shipped in the exact order that they will be used by the customer, thus avoiding the risk of damaging fragile items (as is the case in the glass industry) or the cost of moving heavy items (as is the case in the steel industry). We propose two constructive heuristics extended from the literature for the problem, in addition to a dynamic programming based heuristic that uses as a subroutine an exact pseudo-polynomial time algorithm developed for the Rectangular Knapsack Problem with Batch Constraints. Computational experiments, performed on three sets of realistic instances, showed that the dynamic programming based heuristic found solutions with smaller optimally gaps in all instances evaluated. |
|---|---|
| AbstractList | This paper tackles the 2-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. The problem asks for the cutting of a set of items with the minimum amount of raw material. The cutting patterns are subject to a number of constraints, including a new realistic constraint, regarding item precedence, which has just been introduced in the literature. In this case, the items are organized in stacks, where each stack represents a customer request and defines the order in which the items must be cut. That is, if item i precedes item j within a stack, then i must be cut before j. However, there is no precedence constraint between items in different stacks. This constraint comes from applications where items must be stacked and shipped in the exact order that they will be used by the customer, thus avoiding the risk of damaging fragile items (as is the case in the glass industry) or the cost of moving heavy items (as is the case in the steel industry). We propose two constructive heuristics extended from the literature for the problem, in addition to a dynamic programming based heuristic that uses as a subroutine an exact pseudo-polynomial time algorithm developed for the Rectangular Knapsack Problem with Batch Constraints. Computational experiments, performed on three sets of realistic instances, showed that the dynamic programming based heuristic found solutions with smaller optimally gaps in all instances evaluated. |
| Author | Noronha, Thiago F. Urrutia, Sebastian Carvalho, Iago A. Bogue, Eduardo T. Guimaraes, Marcos V. A. Pereira, Armando H. |
| Author_xml | – sequence: 1 givenname: Eduardo T. surname: Bogue fullname: Bogue, Eduardo T. email: eduardo.theodoro@ufms.br organization: Universidade Federal de Mato Grosso do Sul,Dep. de Ciência da Computação,Ponta Porã,Brazil – sequence: 2 givenname: Marcos V. A. surname: Guimaraes fullname: Guimaraes, Marcos V. A. email: mvaguimaraes@gmail.com organization: Universidade Federal de Minas Gerais,Dep. de Ciência da Computação,Belo Horizonte,Brazil – sequence: 3 givenname: Thiago F. surname: Noronha fullname: Noronha, Thiago F. email: tfn@dcc.ufmg.br organization: Universidade Federal de Minas Gerais,Dep. de Ciência da Computação,Belo Horizonte,Brazil – sequence: 4 givenname: Armando H. surname: Pereira fullname: Pereira, Armando H. email: ahp@dcc.ufmg.br organization: Universidade Federal de Minas Gerais,Dep. de Ciência da Computação,Belo Horizonte,Brazil – sequence: 5 givenname: Iago A. surname: Carvalho fullname: Carvalho, Iago A. email: iago.carvalho@unifal-mg.edu.br organization: Universidade Federal de Alfenas,Dep. de Ciência da Computação,Alfenas,Brazil – sequence: 6 givenname: Sebastian surname: Urrutia fullname: Urrutia, Sebastian email: sebastian.a.urrutia@himolde.no organization: Molde University College,Faculty of Logistics,Molde,Norway |
| BookMark | eNotj91KwzAYQCPohc49gSB5gdZ8-emaS6lzDgsbWK9Hkn51wTaRNmP49hbc1YFzceDckesQAxLyCCwHYPqpqtdbJbgQOWcccl1IBsCvyFKvSigKJbViQt2S9-aItDnH7MUPGCYfg-np5uT7PiYfkFanNPOLfqTovul-jLbHgZ59Os7KzKqKYUqj8SFN9-SmM_2EywsX5PN13VRvWb3bbKvnOvMgRMqcdlBqIcFqVerSWm0UOrlypoRWKKeF5apDKVULhksLrOCu7YwrtDIAKBbk4b_rEfHwM_rBjL-Hy6L4A5mBS8c |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CLEI53233.2021.9640112 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781665495035 1665495030 |
| EndPage | 9 |
| ExternalDocumentID | 9640112 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i133t-c9c189341b95898bb9a5ec47ca81d35c93b25fe445d1a24b1062cdfac695a11e3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000836276100053&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed May 01 11:49:15 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i133t-c9c189341b95898bb9a5ec47ca81d35c93b25fe445d1a24b1062cdfac695a11e3 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_9640112 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-Oct.-25 |
| PublicationDateYYYYMMDD | 2021-10-25 |
| PublicationDate_xml | – month: 10 year: 2021 text: 2021-Oct.-25 day: 25 |
| PublicationDecade | 2020 |
| PublicationTitle | 2021 XLVII Latin American Computing Conference (CLEI) |
| PublicationTitleAbbrev | CLEI |
| PublicationYear | 2021 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.781283 |
| Snippet | This paper tackles the 2-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. The problem asks for the cutting of a set of items with the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Cutting stock Dynamic programming Field-flow fractionation guillotine cut Heuristic algorithms Indexes Logistics Raw materials stack constraints Steel industry |
| Title | The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints |
| URI | https://ieeexplore.ieee.org/document/9640112 |
| WOSCitedRecordID | wos000836276100053&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61ePCk0opv9uDRtJtks9mca6tiKQUr9FaS7CwUSlfa3fr3naRLRfDiLQx5wAwk30xm5iPkgRvIDAIBqhLw0SrJqC1SS1OnYmDKCWdDy_yxmkyy-VxPW-TxUAsDACH5DHp-GP7y89LVPlTW1yl6A55S-EipdF-r1RT9slj3B-PhqxRcCPT6OOs1k3-xpoRHY3T6v-POSPen-i6aHt6Vc9KCdYe8oT2j2VdJn3w7_n0rjei5Xq5WZYVAMRrUIYE5eq_wgvPLPU1M5KOsKDIo8sycgQ-i2nbJx2g4G7zQhgiBLtGFrKjTjiGuSJjVMtOZtdpIcIlyBtGmkE4Ly2UBSSJzZnhi0c3jLi-MS7U0jIG4IO11uYZLn8nErWEI-jRuoJXUBReFSQFtVsSO2SvS8YpYfO57XSwaHVz_Lb4hJ17X_i7n8pa0q00Nd-TY7arldnMfDPQN8bOT0g |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lCnpSacW3e_DotpvX7uZcW1u6loIVeitJOguF0pV2V_--k3RRBC_ewpAHzEDyzWRmPkIemIZUIxAIEwEuWiVpaPLYhLFNIqCJ5db4lvlZMpmk87maNsjjdy0MAPjkM-i4of_LXxa2cqGyrorRG3CUwgdSCBbtq7Xqsl8aqW4v648kZ5yj38dop57-izfFPxuDk_8deEraP_V3wfT7ZTkjDdi0yBgtGsw-i_DJNeTfN9MInqvVel2UCBWDXuVTmIPXEq84t9wRxQQuzooijSLHzekZIcpdm7wN-rPeMKypEMIVOpFlaJWliCwENUqmKjVGaQlWJFYj3uTSKm6YzEEIuaSaCYOOHrPLXNtYSU0p8HPS3BQbuHC5TMxoirBP4QYqkSpnPNcxoNXyyFJzSVpOEYv3fbeLRa2Dq7_F9-RoOHvJFtloMr4mx07v7mZn8oY0y20Ft-TQfpSr3fbOG-sL0aqXGQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2021+XLVII+Latin+American+Computing+Conference+%28CLEI%29&rft.atitle=The+Two-Dimensional+Guillotine+Cutting+Stock+Problem+with+Stack+Constraints&rft.au=Bogue%2C+Eduardo+T.&rft.au=Guimaraes%2C+Marcos+V.+A.&rft.au=Noronha%2C+Thiago+F.&rft.au=Pereira%2C+Armando+H.&rft.date=2021-10-25&rft.pub=IEEE&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1109%2FCLEI53233.2021.9640112&rft.externalDocID=9640112 |