A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
Summary: The irregular strip packing problem (ISPP) is a class of cutting and packing problem (C\&P) in which a set of items with arbitrary formats must be placed in a container with a variable length. The aim of this work is to minimize the area needed to accommodate the given demand. ISPP is present in various types of industries from manufacturers to exporters (e.g., shipbuilding, clothes, and glass). In this paper, we propose a parallel Biased Random-Key Genetic Algorithm \(( \mu \)-BRKGA) with multiple populations for the ISPP by applying a collision-free region (CFR) concept as the positioning method, in order to obtain an efficient and fast layout solution. The layout problem for the proposed algorithm is represented by the placement order into the container and the corresponding orientation. In order to evaluate the proposed \(( \mu \)-BRKGA) algorithm, computational tests using benchmark problems were applied, analyzed, and compared with different approaches.
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Resolution of strip-packing problems with genetic algorithms
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- A biased random-key genetic algorithm for the container pre-marshalling problem
- Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms
- A 2-exchange heuristic for nesting problems
- A beam search implementation for the irregular shape packing problem
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A Solution of the Rectangular Cutting-Stock Problem
- An improved typology of cutting and packing problems
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Dealing with nonregular shapes packing
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Mixed-integer programming models for nesting problems
- On genetic algorithms for the packing of polygons
- Orthogonal Packings in Two Dimensions
- Polygon decomposition for efficient construction of Minkowski sums
- Solution approaches to irregular nesting problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Solving nesting problems with non-convex polygons by constraint logic programming
- TOPOS -- A new constructive algorithm for nesting problems
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
- Raster penetration map applied to the irregular packing problem
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Biased random-key genetic algorithms: a review
- A parallel branch-and-bound-and-check algorithm for nesting
This page was built for publication: A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992380)
