Packing Problems
Mostrando 1-12 de 31 artigos, teses e dissertações.
-
1. Caracterização da cinza de caroço de açaí residual para adição ao concreto
Resumo Os problemas ambientais são uma realidade do mundo atual e vêm associados ao crescimento urbano e populacional, com pouco ou nenhum planejamento. O setor da construção civil é um dos maiores consumidores de recursos naturais e gerador de resíduos sólidos. Assim, é interessante pensar em uma maneira de incorporar materiais que hoje são conside
Ambient. constr.. Publicado em: 2019-03
-
2. A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM
ABSTRACT The irregular strip packing problem is a common variant of cutting and packing problems. Only a few exact methods have been proposed to solve this problem in the literature. However, several heuristics have been proposed to solve it. Despite the number of proposed heuristics, only a few methods that combine exact and heuristic approaches to solve th
Pesqui. Oper.. Publicado em: 2016-12
-
3. A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM
ABSTRACT Two-dimensional rectangular strip packing problems belong to the broader class of Cutting and Packing (C&P) problems, in which small items are required to be cut from or packed on a larger object, so that the waste (unused regions of the large object) is minimized. C&P problems differ from other combinatorial optimization problems by the intrinsic g
Pesqui. Oper.. Publicado em: 2016-08
-
4. A GRASP ALGORITHM FOR THE CONTAINER LOADING PROBLEM WITH MULTI-DROP CONSTRAINTS
This paper studies a variant of the container loading problem in which to the classical geometric constraints of packing problems we add other conditions appearing in practical problems, the multi-drop constraints. When adding multi-drop constraints, we demand that the relevant boxes must be available, without rearranging others, when each drop-off point is
Pesqui. Oper.. Publicado em: 2015-04
-
5. Two-dimensional packing problems in telecommunications
We present the transcript of the IFORS distinguished lecture delivered by the author on invitation of SOBRAPO and IFORS. The lecture concerned the development of an interdisciplinary research motivated by an application in mobile telecommunication systems, a project jointly developed by four research teams. The presentation follows the typical steps of a cla
Pesqui. Oper.. Publicado em: 2014-04
-
6. Extensions of cutting problems: setups
Even though the body of literature in the area of cutting and packing is growing rapidly, research seems to focus on standard problems in the first place, while practical aspects are less frequently dealt with. This is particularly true for setup processes which arise in industrial cutting processes whenever a new cutting pattern is started (i.e. a pattern i
Pesqui. Oper.. Publicado em: 2013-08
-
7. Problemas de corte com sobras aproveitáveis e eliminação de simetrias / Cutting stock problems with usable leftover and symmetry breaking
In this work we study two variations of the packing problem where identical rectangular items must be packed into a polyhedron. One of the variations consists in finding the largest amount of rectangular items that can fit in a polyhedron. The other one consists in finding a minimal area polyhedron of a certain type that packs a set of rectangular identical
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 20/09/2012
-
8. NUMERICAL ANALYSIS OF SAND CONTROL METHODS IN OIL-PRODUCING ROCKS / ANÁLISE NUMÉRICA DE MEDIDAS DE CONTENÇÃO DE SÓLIDOS EM ROCHAS PRODUTORAS DE ÓLEO DO BRASIL
During the production steps of a petroleum well, issues regarding sand production may have hight costs due to damages in the equipment or reduction of the well¿s productivity. Such problems make the application of sand control systems in the completion phase one of the most complex and essential parts in the construction of the well. This work aims to simul
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 19/08/2011
-
9. Algorithm for the determination of the collision freee region and its application for the two-dimensional irregular packing problem using simulated annealing. / Proposta de algoritmo para a determinação da região livre de colisão e sua aplicação na solução de leiautes bidimensionais irregulares com recozimento simulado.
O problema de empacotamento consiste em arranjar um conjunto de itens em um contêiner, a fim de maximizar sua utilização. Este campo de estudos tem impacto em diversas indústrias, incluindo as indústrias têxtil, moveleira e naval. Neste trabalho, dois problemas de empacotamento de itens irregulares são estudados. O primeiro, chamado primal, é o caso
Publicado em: 2011
-
10. Condicionantes da produção do tomate de mesa na região de Campinas,SP / Factors that affect tomato production in the region of Campinas,SP
The planting of tomato has a special relevance in Brazil, for its representation in area planted and the second most important vegetable crop growing area, with over three million tons. Thus, it is important to review how it is structured the production system and how it relates to the other links in the chain. The objective of this study was to characterize
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 24/02/2010
-
11. Algoritmos para problemas de corte e empacotamento / Algorithms for cutting and packing problems
Several versions of Cutting and Packing problems are considered NP-hard and, if we consider that P ¿ NP, we do not have any exact polynomial algorithm for solve them. Practical applications arises for such problems and include: resources allocation for computers; cut of steel, wood, glass, aluminum, etc.; packing of objects; and, loading objects into contai
Publicado em: 2010
-
12. Problema da mochila com itens irregulares / Irregular knapsack problems
Nesta dissertação, estudamos problemas de empacotamento com itens irregulares. Estamos particularmente interessados no Problema da Mochila Bidimensional: dados um recipiente de tamanho W x H e uma lista de itens bidimensionais, o objetivo é empacotar um subconjunto dos itens de forma a maximizar a área dos itens empacotados. Existem diversos trabalhos qu
Publicado em: 2010