A revision of recent approaches for two-dimensional strip-packing problems

Riff, María Cristina; Bonnaire, Xavier; Neveu, Bertrand

doi:10.1016/j.engappai.2008.10.025

Cited by 43 publications

(27 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Para este proposto problema de empacotamento de amendoins, a soluçãoótimaé obtida pela aplicação do Método Simplex [7] com apoio computacional. A fábrica em estudo empacota amendoins em dois diferentes tipos de embalagens: A (60 g) e B (140 g), sendo que a fábrica dispõe de 1000 embalagens tipo A e 1000 embalagens tipo B. Para empacotar os amendoins nessas embalagens, são adquiridos 60.000g de amendoins, comprados a granel.…”

Section: Aplicação Da Programação Linear Em Uma Fábrica De Empacotameunclassified

See 1 more Smart Citation

Modelagem e solução de problemas de corte e empacotamento por meio da programação linear

Bressan¹,

Belinelli²

2016

C.Q.D.

View full text Add to dashboard Cite

Modelagem e solução de problemas de corte e empacotamento por meio da programação linearModeling and solution of cutting and packing problems using linear programming Resumo Muitas indústrias que trabalham com processos de corte e empacotamento podem gerar sobras indesejáveis de materiais que muitas vezes não podem ser reaproveitadas. O estudo de problemas por meio da modelagem matemática e da Programação Linear permite estabelecer padrões de corte e de empacotamento que resultem na perda ou no custo mínimo. Neste contexto, este trabalho tem o objetivo de estudar a modelagem matemática dos problemas de corte e de empacotamento, por meio da Programação Linear, aplicados em duas fábricas distintas. O primeiro estudo minimiza a perda de alimento durante o processo de empacotamento de amendoins de uma fábrica do município de Nova Fátima-PR, por meio da aplicação do Problema de Empacotamento. O segundo estudo minimiza a perda de matéria-prima durante o processo de corte e acabamento de papéis, por meio da aplicação do Problema do Corte, numa gráfica do município de Ibaití-PR. Os resultados foram obtidos por meio da aplicação do Método Simplex com apoio computacional. Palavras-chave: Programação Linear. Método Simplex. Problema do Corte. Problema de Empacotamento. AbstractMany industries that work with cutting and packing processes can generate undesirable waste materials that often cannot be reused. The study of problems using mathematical modeling and Linear Programming allows us to establish cutting and packaging standards that result in minimum loss or minimum cost. In this context, the goal of this paper is to study the mathematical modeling of cutting and packaging problems, using Linear Programming and to apply its in two distinct companies. The first study minimizes loss of product during the process of packaging of peanuts from a factory in the Nova Fátima-PR city, by applying the packaging problem. The second study minimizes the loss of raw material during the paper cutting process, by applying the cutting problem from a printing company located in Ibaití-PR city. The results were obtained using the Simplex Method with computational support.

show abstract

Section: Aplicação Da Programação Linear Em Uma Fábrica De Empacotameunclassified

“…Um problema unidimensional para a formulação matemática de um Problema de Corteé formulado em [5] e esta modelagemé estendida para problemas com dimensões maiores. Em [7],é feita uma revisão das abordagens propostas na literatura para os problemas de empacotamento em faixas bi-dimensional.…”

Section: Introductionunclassified

Modelagem e solução de problemas de corte e empacotamento por meio da programação linear

Bressan¹,

Belinelli²

2016

C.Q.D.

View full text Add to dashboard Cite

show abstract

“…Among the most popular types of packing problems in industry and manufacturing can be distinguished orthogonal bin packing problems, cutting stock problems and knapsack problems. The most frequently the packing problems are occurred in solution of such practical problems as waste minimization in cutting, pallet building in logistics, filling up containers (including truck, ship and air cargo loading), traffic and calendar planning and many others [3][4][5][6]. Optimization of the packing problems leads to more efficient usage of free storage spaces in practice [1,7].…”

Section: Introductionmentioning

confidence: 99%

“…The effective approach to solve NP-completed problems is application of various metaheuristic optimization methods of artificial intelligence to them. The most effective methods that used for solving all the packing and cutting problems are evolutionary algorithms among which are the genetic algorithm, the annealing algorithm, the ant colony algorithm, as well as their modified and combined variants [6,[9][10][11].…”

Section: Introductionmentioning

confidence: 99%

Development of Optimization Software to Solve Practical Packing and Cutting Problems

Chekanin¹,

Chekanin²

2015

Advances in Intelligent Systems Research

View full text Add to dashboard Cite

Abstract-The paper describes a developed optimization software intended to solve various practical problems of recourse allocation. In a basis of the software lays a designed class library for solving different recourse allocation problems including packing and cutting problems. Due to belonging of all packing problems to the class of NP-completed problems they cannot be solved in polynomial time depending on their size. To solve such problems are usually used metaheuristic algorithms of multicriteria optimization. The designed class library allows to solve all packing and problems using a variety of metaheuristic algorithms which makes the developed software universal with respect to types of solved problems and algorithms used.

show abstract

“…Arranging can be divided into rectangular packing and irregular nesting [5]. The rectangle pieces with simple shapes have been widely used.…”

Section: Introductionmentioning

confidence: 99%

Research on the Arranging and Patchwork Design for Storage Tank Bottom Based on Sinovation

Yang¹,

Chuanjuan²,

Zhang³

et al. 2015

TOPEJ

View full text Add to dashboard Cite

Abstract:In the paper, to solve the patchwork problem of large chemical storage tank bottom, theoretical researches on arranging special-shaped parts are carried out. The heuristic layout algorithm with dynamic decision layout order and based on graphics position strategy is proposed. According to the algorithm, basing on Sinovation platform, using the object-oriented programming language C++ and Visual Studio tools, the arranging and patchwork system is designed and developed. And the application researches are performed with the system. The results show that, comparing with the rectangular envelopment algorithm, the plate utilization ratio is increased with the patchwork algorithm as proposed in the paper.

show abstract

A revision of recent approaches for two-dimensional strip-packing problems

Cited by 43 publications

References 14 publications

Modelagem e solução de problemas de corte e empacotamento por meio da programação linear

Modelagem e solução de problemas de corte e empacotamento por meio da programação linear

Development of Optimization Software to Solve Practical Packing and Cutting Problems

Research on the Arranging and Patchwork Design for Storage Tank Bottom Based on Sinovation

Contact Info

Product

Resources

About