Research on irregular sponge layout system based on heuristic algorithms

Abstract A layout optimization method that integrates No-Fit Polygons (NFP) positioning and a genetic algorithm is proposed for the two-dimensional irregular sponge packing problem. Firstly, according to the geometric characteristics of the parts, they are classified and encoded to calculate the NFP between part classes, avoiding redundant NFP calculations. Simultaneously, heuristic rules aimed at minimizing the packing height are introduced to provide a comprehensive evaluation function for part positioning strategies, thus improving packing efficiency. Secondly, in the optimization of part sorting, a genetic algorithm is introduced to optimize the sponge packing algorithm. Finally, several standard cases provided by the European Special Interest Group on Cutting and Packing (ESICUP) are used to test the proposed packing method. The results show that compared to the traditional Bottom-Left algorithm, the computational efficiency of the proposed packing method is improved by 4.20% to 22.73%.

Authors

Institutions

Publication Details

Journal
Journal of Physics Conference Series
Published
2024-10-01
DOI
https://doi.org/10.1088/1742-6596/2858/1/012027
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on irregular sponge layout system based on heuristic algorithms

Wenle Zhang, Tian Chen
Journal of Physics Conference Series
Optimization and Packing Problems
article

Research on irregular sponge layout system based on heuristic algorithms

Wenle Zhang, Tian Chen
article en

Abstract

Abstract A layout optimization method that integrates No-Fit Polygons (NFP) positioning and a genetic algorithm is proposed for the two-dimensional irregular sponge packing problem. Firstly, according to the geometric characteristics of the parts, they are classified and encoded to calculate the NFP between part classes, avoiding redundant NFP calculations. Simultaneously, heuristic rules aimed at minimizing the packing height are introduced to provide a comprehensive evaluation function for part positioning strategies, thus improving packing efficiency. Secondly, in the optimization of part sorting, a genetic algorithm is introduced to optimize the sponge packing algorithm. Finally, several standard cases provided by the European Special Interest Group on Cutting and Packing (ESICUP) are used to test the proposed packing method. The results show that compared to the traditional Bottom-Left algorithm, the computational efficiency of the proposed packing method is improved by 4.20% to 22.73%.

Journal of Physics Conference SeriesVol. 2858(1)
Shanghai Dianji University (CN)
Openalex Percentile: Top 76%
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.