A heuristic for nesting problems of irregular shapes

  • Authors:
  • Wen-Chen Lee;Heng Ma;Bor-Wen Cheng

  • Affiliations:
  • Graduate School of Industry Engineering and Management, National Yunlin University of Science and Technology, Douliou, Yunlin 64002, Taiwan;Department of Industrial Engineering and System Management, Chung Hua University, HsinChu 300, Taiwan;Graduate School of Industry Engineering and Management, National Yunlin University of Science and Technology, Douliou, Yunlin 64002, Taiwan

  • Venue:
  • Computer-Aided Design
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.