A Parallel Biased Random‐Key Genetic Algorithm with Multiple Populations Applied to Irregular Strip Packing Problems
Bonfim Amaro Júnior, Plácido Rogério Pinheiro, Pedro Veras Coelho
Source abstract
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 ( µ ‐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 ( µ ‐BRKGA) algorithm, computational tests using benchmark problems were applied, analyzed, and compared with different approaches.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.