Welcome to the UPF Digital Repository

Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem

Show simple item record

dc.contributor.author De Armas, Jésica
dc.contributor.author Miranda, Gara
dc.contributor.author León, Coromoto
dc.date.accessioned 2024-02-12T10:05:34Z
dc.date.available 2024-02-12T10:05:34Z
dc.date.issued 2012
dc.identifier.citation de Armas J, Miranda G, León C. Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem. Eur J Oper Res. 2012 Jun 1;219(2):201-13. DOI: 10.1016/j.ejor.2011.11.002
dc.identifier.issn 0377-2217
dc.identifier.uri http://hdl.handle.net/10230/59082
dc.description.abstract This work introduces several improvements in the solution of the Constrained 2D Cutting Problem. Such improvements combine the detection of dominated and duplicated cutting patterns with the implementation of parallel approaches for best-first search methods. The analysis of symmetries and dominances among the cutting patterns is able to discard some non-optimal or redundant builds, thus reducing the search space to be explored. The experimental evaluation demonstrates that when the domination/duplication rules are applied to an efficient parallel approach, the obtained reduction in the number of managed nodes involves a noticeable decrease in the computational effort associated with the final search process.
dc.description.sponsorship This work was funded by the EC (FEDER) and the Spanish Ministry of Science and Technology as part of the ‘Plan Nacional de I+D+i’ (TIN2008-06491-C04-02). The Canary Government has also funded this work through the PI2007/015 research project. The work of Jesica de Armas was funded by grant FPU-AP2007-02414.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Elsevier
dc.relation.ispartof European Journal of Operational Research. 2012 Jun 1;219(2):201-13
dc.rights © Elsevier http://dx.doi.org/10.1016/j.ejor.2011.11.002
dc.title Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
dc.type info:eu-repo/semantics/article
dc.identifier.doi http://dx.doi.org/10.1016/j.ejor.2011.11.002
dc.subject.keyword Cutting problems
dc.subject.keyword Parallel algorithms
dc.subject.keyword Pattern dominances and symmetriess
dc.subject.keyword Exact tree searches
dc.relation.projectID info:eu-repo/grantAgreement/ES/3PN/TIN2008-06491-C04-02
dc.rights.accessRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/acceptedVersion

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics

In collaboration with Compliant to Partaking