By Topic

A Rotatable Placement Algorithm and GA to the Nesting Problem

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

3 Author(s)
Tzuo-Liang Luo ; Mech. & Syst. Res. Labs., Ind. Technol. Res. Inst., Hsinchu, Taiwan ; Jian-Horng Chen ; Yuan-Lung Lai

The objective of two-dimensional optimal nesting problem is to place the same or different pieces of the fixed quantity on the sheet in this paper. What we want to do is increase the rate of utility and decrease the waste of panel. Generally, determine the quality of the nesting results; it can briefly be divided into two factors: placement algorithm and permutation. Placement algorithm means to decide the positions where the pieces place into the sheet. And permutation is the placing sequence order of pieces. If the sequence of permutation is available and the placement rule also meets the demand of packing, then the exact or optimal solutions could be found. This research provides a new placement algorithm rule "area-decomposition" method. This combines the rotation function for each piece and genetic algorithm. A comparison of nesting with literature and commercial software shows the results. This research can really acquire good results of nesting according to the demand of different situations in interest.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:5 )

Date of Conference:

March 31 2009-April 2 2009