The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
March 31, 2009 to April 2, 2009
ISBN: 978-0-7695-3507-4
pp: 451-455
ABSTRACT
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, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 451-455, doi:10.1109/CSIE.2009.914
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool