کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
440479 | 691032 | 2008 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A heuristic for nesting problems of irregular shapes A heuristic for nesting problems of irregular shapes](/preview/png/440479.png)
Layout has a close relationship with product cost in the vein of how to most efficiently cut product patterns from raw materials. This is the so-called “nesting problem”, which occurs frequently in sheet metal and furniture industries, wherein material utilization needs to be maximized. In this paper, a quick location and movement (QLM) algorithm is proposed to solve the situation of irregular shapes nested on multiple irregular sheets. This approach includes two major parts: it first approximates irregular shapes to a polygon with the use of a cluster of straight lines, and second, it arranges the approximated shapes one-by-one with the proposed step-by-step rule. Finally, this study investigates and compares examples presented by other authors. The results show that the QLM algorithm takes less time to calculate a layout and the material utilization efficiency is higher compared to other methods.
Journal: Computer-Aided Design - Volume 40, Issue 5, May 2008, Pages 625–633