Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/87924
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE ESTADUAL DE CAMPINASpt_BR
dc.identifier.isbnpt_BR
dc.contributor.authorunicampMiyazawa, Flávio Keidipt_BR
dc.typeArtigopt_BR
dc.titleOrder and static stability into the strip packing problempt_BR
dc.title.alternativept_BR
dc.contributor.authorQueiroz, Thiago Alves dept_BR
dc.contributor.authorMiyazawa, Flávio Keidipt_BR
unicamp.authorMiyazawa, F.K., Institute of Computing, IC/UNICAMP, Campinas, SP 13083-852, Brazilpt_BR
unicamp.author.externalde Queiroz, T.A., Department of Mathematics, UFG/CAC, Catalão, GO 75704-020, Brazilpt
dc.subjectProblemas de empacotamentopt_BR
dc.subjectAlgoritmospt_BR
dc.subjectOtimização combinatóriapt_BR
dc.subjectProgramação inteirapt_BR
dc.subject.otherlanguagePacking problemspt_BR
dc.subject.otherlanguageAlgorithmspt_BR
dc.subject.otherlanguageCombinatorial optimizationpt_BR
dc.subject.otherlanguageInteger programmingpt_BR
dc.description.abstractThis paper investigates the two-dimensional strip packing problem considering the case in which items should be arranged to form a physically stable packing satisfying a predefined item unloading order from the top of the strip. The packing stability analysis is based on conditions for the static equilibrium of rigid bodies, differing from others strategies which are based on area and percentage of support. We consider an integer linear programming model for the strip packing problem with the order constraint, and a cutting plane algorithm to handle stability, leading to a branch-and-cut approach. We also present two heuristics: the first is based on a stack building algorithm; and, the last is a slight modification of the branch-and-cut approach. The computational experiments show that the branch-and-cut model can handle small and medium-sized instances, whereas the heuristics found almost optimal solutions quickly for several instances. With the combination of heuristics and the branch-and-cut algorithm, many instances are solved to near optimality in a few seconds. © 2014 Springer Science+Business Media New York.en
dc.description.abstractThis paper investigates the two-dimensional strip packing problem considering the case in which items should be arranged to form a physically stable packing satisfying a predefined item unloading order from the top of the strip. The packing stability analpt_BR
dc.relation.ispartofAnnals of operations researchpt_BR
dc.relation.ispartofabbreviationAnn. oper. res.pt_BR
dc.publisher.cityNew York, NYpt_BR
dc.publisher.countryEstados Unidospt_BR
dc.publisherSpringerpt_BR
dc.date.issued2014pt_BR
dc.date.monthofcirculationDec.pt_BR
dc.identifier.citationAnnals Of Operations Research. , v. , n. , p. - , 2014.pt_BR
dc.language.isoengpt_BR
dc.description.volume223pt_BR
dc.description.issuenumber1pt_BR
dc.description.issuesupplementpt_BR
dc.description.issuepartpt_BR
dc.description.issuespecialpt_BR
dc.description.firstpage137pt_BR
dc.description.lastpage154pt_BR
dc.rightsfechadopt_BR
dc.rightsfechadopt_br
dc.sourceSCOPUSpt_BR
dc.identifier.issn0254-5330pt_BR
dc.identifier.eissn1572-9338pt_BR
dc.identifier.doi10.1007/s10479-014-1634-2pt_BR
dc.identifier.urlhttps://link.springer.com/article/10.1007/s10479-014-1634-2pt_BR
dc.description.sponsorshipCNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - Conselho Nacional de Desenvolvimento Científico e Tecnológicopt_BR
dc.description.sponsorshipFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE GOIÁSpt_BR
dc.description.sponsordocumentnumbersem informaçãopt_BR
dc.date.available2015-06-25T18:02:52Z
dc.date.available2015-11-26T15:05:05Z-
dc.date.accessioned2015-06-25T18:02:52Z
dc.date.accessioned2015-11-26T15:05:05Z-
dc.description.provenanceMade available in DSpace on 2015-06-25T18:02:52Z (GMT). No. of bitstreams: 1 2-s2.0-84901519176.pdf: 550719 bytes, checksum: 553ef30af79cf42ed93b81fdcdda9027 (MD5) Previous issue date: 2014 Bitstreams deleted on 2021-01-04T14:26:03Z: 2-s2.0-84901519176.pdf,. Added 1 bitstream(s) on 2021-01-04T14:27:01Z : No. of bitstreams: 2 2-s2.0-84901519176.pdf: 618403 bytes, checksum: be9c4eabd3f988072a2cf83053fa4426 (MD5) 2-s2.0-84901519176.pdf.txt: 53161 bytes, checksum: 10f84977d5b851232059176a53299c7c (MD5)en
dc.description.provenanceMade available in DSpace on 2015-11-26T15:05:05Z (GMT). No. of bitstreams: 2 2-s2.0-84901519176.pdf: 550719 bytes, checksum: 553ef30af79cf42ed93b81fdcdda9027 (MD5) 2-s2.0-84901519176.pdf.txt: 53161 bytes, checksum: 10f84977d5b851232059176a53299c7c (MD5) Previous issue date: 2014en
dc.identifier.urihttp://www.repositorio.unicamp.br/handle/REPOSIP/87924
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/87924-
dc.identifier.idScopus2-s2.0-84901519176pt_BR
dc.description.conferencenomept_BR
dc.contributor.departmentDepartamento de Teoria da Computaçãopt_BR
dc.contributor.unidadeInstituto de Computaçãopt_BR
dc.subject.keywordTwo-dimensional strip packing problempt_BR
dc.subject.keywordOrder constraintpt_BR
dc.subject.keywordCargo stabilitypt_BR
dc.subject.keywordStatic equilibrium of rigid bodiespt_BR
dc.subject.keywordInteger programmingpt_BR
dc.identifier.source2-s2.0-84901519176pt_BR
dc.creator.orcid0000-0002-1067-6421pt_BR
dc.type.formArtigopt_BR
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-84901519176.pdf603.91 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.