SinoTechIntel Academic Portal
Official PDF TranslationENGINEERING Information Technology & Electronic Engineering

Hierarchical algorithm for large-scale irregular packing problems

Authors: Xiao LIU

DOI: 10.1631/ENG_ITEE_2025_0080Status: Verified Translated Edition
Sponsored AdvertisementAd Placement Area
reCAPTCHA Bot Shield Active

Preparing Secure Academic Download

Verifying human reader & generating high-resolution document...

Verifying Document Integrity15s remaining
← Back to Article
Protected by Google reCAPTCHA v3.PrivacyTerms
Sponsored ContentAdSense In-Feed Ad Slot

Key Findings in This Report

• Proposes a novel hierarchical algorithm that classifies parts into three levels based on area and fullness, enabling efficient packing of up to 1400 irregular parts on multiple sheets—a scale beyond prior irregular packing studies. • Introduces an innovative "shape matching" method that uses rotation and translation to achieve contour complementarity, with a shape matching coefficient (SMC) to evaluate match quality. • Integrates box stacking, shape matching, and gravity packing strategies to avoid hooking issues and promote orderly, compact arrangements, yielding higher material utilization than traditional gravity packing. • Maintains computation time suitable for engineering applications, making it practical for shipbuilding, sheet metal processing, and large-scale manufacturing.
Download Full PDF: Hierarchical algorithm for large-scale irregular packing problems | SinoTechIntel | SinoTechIntel