Efficient Packing of 2D Irregular Parts: A Hybrid Approach Incorporating a Modified Genetic Algorithm and Image Processing

This study proposes a technique for effectively arranging irregularly shaped parts on a board using a modified genetic algorithm and image processing. This technique addresses the challenge of efficiently packing parts of the same shape and size to optimize the utilization of available space. The optimization process comprises three search steps focused on finding suitable spatial relationships between the parts. The first two steps employ variance and envelope area criteria to optimize the position of the patterns, while the third step considers the distance between two columns of arranged parts. To enhance the accuracy and efficiency of the search process, a local-search-based optimization is proposed. The resulting optimized spatial relationships are derived from the three-step search process. The final layout strategy selects spatial relationships to maximize pattern accommodation on the board and arranges them horizontally to optimize utilization. The experimental results demonstrate the effectiveness of the proposed method in optimizing part layout for industrial production. Overall, this technique offers a solution for achieving effective packing, efficient resource utilization, and waste reduction.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-11-06
DOI
https://doi.org/10.3390/math12223470
Citations
1
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Packing of 2D Irregular Parts: A Hybrid Approach Incorporating a Modified Genetic Algorithm and Image Processing

Ray Tahir Mushtaq, Aqib Mashood Khan, Saqib Anwar, Longhui Meng et al.
1 citations
Mathematics
Optimization and Packing Problems
0.35
article

Efficient Packing of 2D Irregular Parts: A Hybrid Approach Incorporating a Modified Genetic Algorithm and Image Processing

Ray Tahir Mushtaq, Aqib Mashood Khan, Saqib Anwar, Longhui Meng, Liang Ding
article en
1 citations

Abstract

This study proposes a technique for effectively arranging irregularly shaped parts on a board using a modified genetic algorithm and image processing. This technique addresses the challenge of efficiently packing parts of the same shape and size to optimize the utilization of available space. The optimization process comprises three search steps focused on finding suitable spatial relationships between the parts. The first two steps employ variance and envelope area criteria to optimize the position of the patterns, while the third step considers the distance between two columns of arranged parts. To enhance the accuracy and efficiency of the search process, a local-search-based optimization is proposed. The resulting optimized spatial relationships are derived from the three-step search process. The final layout strategy selects spatial relationships to maximize pattern accommodation on the board and arranges them horizontally to optimize utilization. The experimental results demonstrate the effectiveness of the proposed method in optimizing part layout for industrial production. Overall, this technique offers a solution for achieving effective packing, efficient resource utilization, and waste reduction.

MathematicsVol. 12(22)
Nanjing Tech University (CN), Northwestern Polytechnical University (CN), King Saud University (SA), Nanjing University of Aeronautics and Astronautics (CN)
King Saud University
Openalex Percentile: Top 34%
Optimization and Packing Problems
0.35
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.