This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
A Rotatable Placement Algorithm and GA to the Nesting Problem
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Index Terms:
Nesting, Placement algorithm, Genetic algorithm
Citation:
Tzuo-Liang Luo, Jian-Horng Chen, Yuan-Lung Lai, "A Rotatable Placement Algorithm and GA to the Nesting Problem," csie, vol. 5, pp.451-455, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.