Optimal directional nesting of planar profiles on fabric bands for composites manufacturing

Siasos, Alexandros; Vosniakos, George–Christopher

doi:10.1016/j.cirpj.2014.06.001

Cited by 8 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Recientemente se ha explorado la búsqueda estocástica en combinación con heurísticas existentes o novedosas, planteando métodos híbridos basados en técnicas de inteligencia artificial Turton 2001) (Tay et al 2002) (Cheng and Rao 2000) (Lee et al 2008) y en heurísticas de BLF (Siasos and Vosniakos 2014).…”

Section: Estado Del Arteunclassified

Un método de optimización proximal al problema de anidamiento de piezas irregulares utilizando arquitecturas en paralelo

D‘Amato

Mercado

Heiling

et al. 2016

Revista Iberoamericana de Automática e Informática Industrial R

View full text Add to dashboard Cite

a bResumen Se presenta un modelo discreto que resuelve el problema bidimensional de corte y ubicación, generalmente llamado (anidamiento), de gran interés en las industrias textiles. El problema consiste en minimizar el remanente o desperdicio de un material a través de la ordenación de moldes geométricamente irregulares. Como solución se propone un algoritmo heurístico polinomial, flexible porque permite evaluar distintas condiciones y restricciones del problema, y paralelizable en arquitecturas de múltiples núcleos de bajo costo. La metodología propuesta se evaluó con casos de estudio de la literatura del área y se comparan los tiempos de cómputo con una herramienta comercial del sector, obteniéndose muy buenos resultados. Además, se logra una aceleración del procesamiento de hasta 4X con respecto a la versión secuencial.

show abstract

Section: Estado Del Arteunclassified

Un método de optimización proximal al problema de anidamiento de piezas irregulares utilizando arquitecturas en paralelo

D‘Amato

Mercado

Heiling

et al. 2016

Revista Iberoamericana de Automática e Informática Industrial R

View full text Add to dashboard Cite

show abstract

“…In [2], Siasos and Vosniakos propose a method that covers all stages of the nesting problem. Regarding the process of modeling the parts, it uses a 4-way representation system.…”

Section: Introductionmentioning

confidence: 99%

An Improved Nesting Algorithm for Irregular Patterns

Martinez-Martinez¹,

Sánchez-Romero²,

Jimeno-Morenilla³

et al. 2021

Preprint

View full text Add to dashboard Cite

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

show abstract

“…Several heuristic methods have been proposed for the irregular strip packing problem via an approximation of irregular shapes by quasi-polyominoes. Pargas and Jain (1993) developed a parallel stochastic optimization algorithm, while Babu and Babu (2001), Fischer and Dagli (2004), Wong et al (2009), Zhang and Yang (2009), Siasos and Vosniakos (2014) developed genetic algorithms for the irregular strip packing problem using approximations by polyominoes. In general, these algorithms have the same basic structure.…”

Section: Quasi-polyomino Tiling and Strip Packing Problemsmentioning

confidence: 99%

Irregular and quasi-polyomino strip packing problems

Rodrigues¹

View full text Add to dashboard Cite

The irregular strip packing problem consists in the cutting of a set of two-dimensional pieces from an object of fixed width using the minimum possible length. Despite its economic importance for many industries, because of its resolution difficulty few exact methods have addressed this problem. Recently, a mixed integer programming model in which pieces are placed on a grid has been proposed. Although the model has proved the optimality for some large instances, it has a large number of non-overlap constraints, which grows quickly according to the discretization resolution and number of distinct pieces. This thesis proposes a clique covering model to reduce the number of constraints and improve the linear relaxation. The coverings were obtained by a heuristic developed by the author. The model has outperformed the previous model in most evaluated instances and obtained an optimal solution for instances with up to 25 pieces (22 distinct pieces) subject to grid discretization. Recently, another mixed integer programming model was proposed for the problem, but it may allow a large number of symmetric solutions. In this thesis, new symmetry breaking constraints are proposed to improve the model. Computational experiments were performed for instances with convex pieces. The results show the proposed formulation is better than the previous one for most instances, since it improves lower bounds and reduces run-time and number of nodes explored to prove optimality. A particular case of an irregular item is a polyomino. A polyomino is a set of unit squares connected by joining one of their edges. A quasi-polyomino is a polyomino generalization, since it is a subset of not necessarily connected squares obtained from an equidistant raster grid. Quasi-polyomino cutting and packing problems have many real applications, e.g., leather cutting, sheet metal stamping, design of printed circuit boards and layout of magazines and newspapers. In this thesis, we study the quasi-polyomino strip packing problem. We propose two integer programming models for the problem and evaluate them using state-of-the-art solvers. We evaluate the models using instances taken from the literature and both models obtained good results, solving to optimality an instance with 320 items (20 distinct items) on a strip of dimensions 44x50. As expected, we found more optimal solutions when there are no rotation and flips and when the dimensions of the items are small.

show abstract

Optimal directional nesting of planar profiles on fabric bands for composites manufacturing

Cited by 8 publications

References 23 publications

Un método de optimización proximal al problema de anidamiento de piezas irregulares utilizando arquitecturas en paralelo

Un método de optimización proximal al problema de anidamiento de piezas irregulares utilizando arquitecturas en paralelo

An Improved Nesting Algorithm for Irregular Patterns

Irregular and quasi-polyomino strip packing problems

Contact Info

Product

Resources

About