Um Estudo Sobre O Problema De Empacotamento De Círculos

• Ano de defesa: 2018
• Autor(a) principal: Oliveira, Juliana Rodrigues Silva De [UNIFESP]
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de São Paulo (UNIFESP)
• Palavras-chave em Português: Packing Circles; Nonlinear Optimization; Augmented Lagrangian Method; Newton"S Method; Empacotamento De Círculos; Otimização Não Linear; Lagrangiano Aumentado; Método De Newton
• Link de acesso: https://sucupira.capes.gov.br/sucupira/public/consultas/coleta/trabalhoConclusao/viewTrabalhoConclusao.jsf?popup=true&id_trabalho=7176456; https://repositorio.unifesp.br/handle/11600/52562

The Packing Problems Consist In Arranging Some Subjects Within A Certain Region. In This Work, We Study A Particular Case Of This Problem: The Problem Of Packing Circular Items, In Which The Items That Has To Be Organized Inside Of A Certain Region Are Unitary Circles. We Considered That The Region That Have Those Items Has One Of These Forms: Circular, Square, Rectangular And Triangular Or Strip (That Is, A Rectangle That Has One Of Two Dimensions Fixed). The Goal Is To Minimize The Dimensions Of The Object So That There Is No Overlap Between Any Two Pairs Of Items And Each Item Is Prevented To Cross The Boundary Of The Object. The Knowledge Of This Class Of Problems Is Essential For The Understanding More About The Complex Problems, Such As Packing Molecules. So, The Study About This Subject Is Relevant. Here, We Solve The Problem Of Packing Circles Using Algencan, That Is A Software Based On The Augmented Lagrangian Method For Nonlinear Optimization Problems, And We Compared The Performance Of The Original