Cutting And Packing Problems
Mostrando 1-9 de 9 artigos, teses e dissertações.
-
1. 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
-
2. 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
-
3. 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
-
4. 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
-
5. 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
-
6. Modelos de programação matemática para problemas de carregamento de caixas dentro de contêineres
O objeto de estudo deste trabalho é um caso particular dos problemas de corte e empacotamento, conhecido como problemas de carregamento de contêineres. Estes problemas consistem em arranjar caixas retangulares ortogonalmente dentro de contêineres (ou caminhões, vagões ferroviários e paletes), de maneira a otimizar uma função objetivo, por exemplo, ma
Publicado em: 2009
-
7. Three-dimensional cutting and packing problems and integration with vehicle routing / Problemas de corte e empacotamento tridimensional e integração com roteamento de veiculos
The wide-scale adoption of the containers made the development of the multimodal transport possible. Nowadays, shipment of boxes in containers is an important activity for companies that have in the load transport a logistic factor of high cost. This work presents the development and the application of metaheuristics with adaptive memory in order to solve th
Publicado em: 2006
-
8. Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the
Pesquisa Operacional. Publicado em: 2000-12
-
9. The Compartmentalized Knapsack Problem / O Problema da Mochila Compartimentada
Nesse trabalho, estudamos um problema de otimização combinatorial conhecido por Problema da Mochila Compartimentada, que é uma extensão do clássico Problema da Mochila. O problema consiste em determinar as capacidades adequadas de vários compartimentos que podem vir a ser alocados em uma mochila e como esses compartimentos devem ser carregados, respeit
Publicado em: 2000