By Topic

Fast Nesting of 2-D Sheet Parts With Arbitrary Shapes Using a Greedy Method and Semi-Discrete Representations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ma, Heng ; Dept. of Ind. Manage., Chung-Hua Univ., Hsinchu ; Chia-Cheng Liu

An efficient approach for 2-D sheet part nesting, incorporating a novel space encoding scheme and a greedy method for placing parts, is presented. The space encoding scheme denotes the occupancy of the part and the vacancy of the material sheet by discrete strip segments with an equal width and utilizes real-number coordinates on each segment for representing the occupancy and the vacancy. The greedy method operates in an iterative fashion by generating a part sequence and searching for the best position and orientation of each part in the part sequence. The part sequences are generated by a genetic algorithm with appropriate operators. The searching, based on bound settings, results in a stable searching process that is independent of the number of the parts involved. Experimental results show that the approach proposed is able to operate in an efficient manner and the final placements for the parts are more economical in comparison with a benchmark. The greedy method is particularly efficient in cases containing parts with multiple pieces because the range of the bounds for searching is gradually reduced as the method progresses. Note to Practitioners-This paper was motivated by observing sheetmetal parts in various shapes that are arranged on a rectangular sheet manually to minimize the usage of the sheet. The manual arrangements are highly dependent on one's expertise and experience but the results may vary from case to case. Existing approaches to arrange the parts automatically are usually time-consuming for dealing with parts in complicated shapes. This paper suggests a simple approach using a new decomposition method to describe the parts and the sheet, and a part placing method to efficiently decide the position of each part in a sequence. The part sequences are automatically generated by a known searching algorithm. The proposed approach has been tested in many industrial cases and the results suggest its feasibility and efficiency. In future research, we- - will address the cases requiring "offsets" among parts

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:4 ,  Issue: 2 )