A Model-Based Heuristic for Packing Soft Rotated Rectangles in an Optimized Convex Container with Prohibited Zones
Oksana Melashenko, Tetyana Romanova, Igor Litvinchev, Carlos Gustavo Martínez Gomez, Rui Yang, Bingtao Sun
Source abstract
Packing soft rectangular objects in an optimized convex container is considered. Each soft rectangle can be freely translated and rotated, has a fixed area, and its dimensions can vary in certain limits. The convex container may have prohibited zones where allocation of the objects is not allowed. The soft rectangles must be arranged completely inside the container; mutual intersection and overlapping with prohibited zones is not allowed. The objective is to minimize a certain metric characteristic of the container. The corresponding nonlinear mathematical problem is formulated using the phi-function technique to present non-overlapping and containment conditions. A model-based heuristic is proposed to find reasonable solutions to the problem. Numerical results are provided for triangular, circular, and scaled polygonal containers to validate the model and demonstrate the proposed approach’s efficiency.
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.