A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem

Shalaby, Mohamed; Kashkoush, Mohamed

doi:10.4236/ajor.2013.32024

Cited by 15 publications

(9 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It should be noted that the 2D irregular shape cutting optimization problem is to assign a set of 2D irregularshaped items to a rectangular object in a pattern by which we cut the rectangular object into 2D irregular-shaped items to minimize material waste. Traditionally, the width of the rectangular object in 2D irregular shape cutting optimization is fixed, while "its length is extendable and has to be minimized" (Shalaby & Kashkoush, 2013) Eq. ( 5)…”

Section: Sheathing Cutting Waste Analysismentioning

confidence: 99%

See 1 more Smart Citation

Towards sustainable construction: BIM-enabled design and planning of roof sheathing installation for prefabricated buildings

Liu

Sydora

Altaf³

et al. 2019

Journal of Cleaner Production

View full text Add to dashboard Cite

Section: Sheathing Cutting Waste Analysismentioning

confidence: 99%

“…Essentially, the 2D irregular shape cutting optimization problem is nondeterministic polynomial (NP)-complete. There are two main approaches in solving this optimization problem: (1) sequence-based approach and (2) direct approach (Shalaby & Kashkoush, 2013).…”

Section: Greedy and Pso-based Hybrid Optimization Algorithmmentioning

confidence: 99%

Towards sustainable construction: BIM-enabled design and planning of roof sheathing installation for prefabricated buildings

Liu

Sydora

Altaf³

et al. 2019

Journal of Cleaner Production

View full text Add to dashboard Cite

“…In [15], a modification of BLF method that is able to nest polygons with arcs and holes in a rectangular container is introduced, without discussing the possibility of extending the algorithm to a performed when marker is created from textile materials with oriented structure. The SwarmNest algorithm in [18] uses the particle swarm optimization algorithm (PSO), a pixel method to obtain the initial layout, and direct trigonometry method for the refinement placement. The implementation focuses on hole-free polygons, whereas in our implementation, polygons may have holes, and approximation does not have to be used.…”

Section: Resultsmentioning

confidence: 99%

“…Except for the genetic algorithm, other methods based on evolutionary computation, such as particle swarm optimization [18] and ant colony optimization [19] are also used in the literature. A heuristic approach hybridized with (µ+λ) evolution strategy is applied on shirts and swimsuits.…”

Section: The Implementation and Experiments Were Conducted In Matlab mentioning

confidence: 99%

Hyper-Heuristic Approach for Improving Marker Efficiency

Domović

Rolich

Golub

2018

Autex Research Journal

View full text Add to dashboard Cite

Marker planning is an optimization arrangement problem, where a set of cutting parts need to be placed on a thin paper without overlapping to create a marker – an exact diagram of cutting parts that will be cut from a single spread. An optimal marker that utilizes the length of textile material has to be obtained. The aim of this research was to develop novel algorithms for obtaining an efficient marker that would achieve competitive results and optimize the garment production in terms of improving the utilization of textile material. In this research, a novel Grid heuristic was introduced for obtaining a marker, alongside its improvement methods: Grid-BLP and Grid-Shaking. These heuristics were hybridized with genetic algorithm that determined the placement order of cutting parts using the newly introduced All Equal First (AEF) placement order. A novel individual representation for genetic algorithm was designed that was composed of order sequence, rotation detection and the choice of placement algorithm (hyper-heuristic). Experiments were conducted to determine the best marker making method, and hyper-heuristic efficiency. The implementation and experiments were conducted in MATLAB using GEATbx toolbox on five datasets from the garment industry: ALBANO, DAGLI, MAO, MARQUES and MAN SHIRT. Marker efficiency in percentage was recorded with best results: 84.50%, 80.13%, 79.54%, 84.67% and 86.02% obtained for the datasets respectively. The most efficient heuristic was Grid-Shaking. Hyper-heuristic applied Grid-Shaking in 88% of times. The created algorithm is independent of cutting parts’ shape. It can produce markers of arbitrary shape and is flexible in terms of expansion to new instances from the garment industry (leather nesting, avoiding damaged areas of material, marker making with materials with patterns).

show abstract

“…Each individual of the population is represented by a sequence of items and eventual rotations and/or flips, which is used as input for a constructive heuristic, usually the bottom-left algorithm. Shalaby and Kashkoush (2013) proposed a particle swarm optimization algorithm for the irregular strip packing problem. The algorithm had two stages, the first used an approximation by polyominoes to place the items and the second performed a compaction heuristic based on direct trigonometry.…”

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

A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem

Cited by 15 publications

References 29 publications

Towards sustainable construction: BIM-enabled design and planning of roof sheathing installation for prefabricated buildings

Towards sustainable construction: BIM-enabled design and planning of roof sheathing installation for prefabricated buildings

Hyper-Heuristic Approach for Improving Marker Efficiency

Irregular and quasi-polyomino strip packing problems

Contact Info

Product

Resources

About