An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

Show simple item record

dc.contributor.author Birgin, E. G.
dc.contributor.author Lobato, R. D.
dc.contributor.author Morabito, R. [UNIFESP]
dc.date.accessioned 2016-01-24T13:59:17Z
dc.date.available 2016-01-24T13:59:17Z
dc.date.issued 2010-02-01
dc.identifier http://dx.doi.org/10.1057/jors.2008.141
dc.identifier.citation Journal of the Operational Research Society. Basingstoke: Palgrave Macmillan Ltd, v. 61, n. 2, p. 306-320, 2010.
dc.identifier.issn 0160-5682
dc.identifier.uri http://repositorio.unifesp.br/handle/11600/32241
dc.description.abstract In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. the combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50 000 instances). It is also effective for solving the instances of problem set Cover III (almost 100 000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. the computer implementation and the data sets are available for benchmarking purposes. Journal of the Operational Research Society (2010) 61, 306-320. doi: 10.1057/jors.2008.141 Published online 4 February 2009 en
dc.description.sponsorship PRONEX-Optimization
dc.description.sponsorship Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorship Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.format.extent 306-320
dc.language.iso eng
dc.publisher Palgrave Macmillan Ltd
dc.relation.ispartof Journal of the Operational Research Society
dc.rights Acesso restrito
dc.subject cutting and packing en
dc.subject manufacturer's pallet loading problem en
dc.subject woodpulp stowage problem en
dc.subject non-guillotine cutting pattern en
dc.subject dynamic programming en
dc.subject raster points en
dc.title An effective recursive partitioning approach for the packing of identical rectangles in a rectangle en
dc.type Artigo
dc.contributor.institution Universidade de São Paulo (USP)
dc.contributor.institution Universidade Federal de São Paulo (UNIFESP)
dc.description.affiliation Univ São Paulo, Inst Math & Stat, Dept Comp Sci, BR-05508090 São Paulo, Brazil
dc.description.affiliation Universidade Federal de São Paulo, Sao Carlos, SP, Brazil
dc.description.affiliationUnifesp Universidade Federal de São Paulo, Sao Carlos, SP, Brazil
dc.description.sponsorshipID PRONEX-Optimization: E-26/171.510/2006-APQ1
dc.description.sponsorshipID FAPESP: 2006/53768-0
dc.description.sponsorshipID FAPESP: 2006/03496-3
dc.description.sponsorshipID FAPESP: 2005/57984-6
dc.description.sponsorshipID CNPq: PROSUL 490333/2004-4
dc.description.sponsorshipID CNPq: 522973/1995-4
dc.identifier.doi 10.1057/jors.2008.141
dc.description.source Web of Science
dc.identifier.wos WOS:000273247600013



File

File Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search


Browse

Statistics

My Account