Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Using helical polyhedron for online irregular strip packing problem with free rotations. |
| Συγγραφείς: |
Liu, Yulin1 (AUTHOR) liu-yl20@mails.tsinghua.edu.cn, Zheng, Li1 (AUTHOR) lzheng@tsinghua.edu.cn |
| Πηγή: |
European Journal of Operational Research. Dec2025, Vol. 327 Issue 2, p407-419. 13p. |
| Θεματικοί όροι: |
*Waste minimization, *Mathematical optimization, *Simulation methods & models, *Packing problem (Mathematics), Mixed integer linear programming, Branch & bound algorithms, Rotational motion, Polyhedra |
| Περίληψη: |
The packing of irregular pieces is widely applied across various industries including metalworking, woodworking, clothing manufacturing, and leather goods production. Allowing rotation during packing, particularly in scenarios where materials are homogeneous, can yield superior outcomes by reducing material wastage, thus contributing to cost-saving and environmental preservation. This study investigates the online irregular strip packing problem allowing free rotation, inspired by a leather handicraft workshop, where orders arrive infrequently and vary widely in content. The objective is to minimize the sheet length utilized. Most existing literature models irregular strip packing problem with rotation as a nonlinear programming problem, making it challenging to obtain the optimal position and orientation of every single input piece despite advancements in optimization solvers. In this paper, a novel approach is proposed to solve online irregular strip packing problem with rotation. We rotate the input polygon while simultaneously translating it along the z -axis, forming a helix. Thus, the problem of selecting the rotation angle is transformed into determining the z -coordinate of the helix's cross-section. Subsequently, meshing the helix into a polyhedron allows us to propose a mixed integer linear formulation based on its Minkowski sum with other polygons. To ensure guaranteed optimality, we introduce a branch-and-bound algorithm tailored to the problem. Extensive numerical experiments indicate the effectiveness and competitiveness of our algorithm over state-of-the-art nonlinear formulations for irregular strip packing problem with rotation. • A helical polyhedron approach to solve online packing problem with rotation. • A mixed integer linear formulation using meshing of the helix and Minkowski sum. • Branch-and-bound strategy to solve the mixed integer linear programming problem. • The efficiency of our algorithm surpasses existing ones on large-scale problems. [ABSTRACT FROM AUTHOR] |
|
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |