A rotatable placement algorithm and GA to the nesting problem

Tzuo Liang Luo, Jian Horng Chen, Yuan Lung Lai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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. 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.

Original languageEnglish
Title of host publication2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009
Pages451-455
Number of pages5
Volume5
DOIs
Publication statusPublished - 2009 Nov 16
Event2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 - Los Angeles, CA, United States
Duration: 2009 Mar 312009 Apr 2

Other

Other2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009
CountryUnited States
CityLos Angeles, CA
Period09-03-3109-04-02

Fingerprint

Genetic algorithms
Decomposition

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Luo, T. L., Chen, J. H., & Lai, Y. L. (2009). A rotatable placement algorithm and GA to the nesting problem. In 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 (Vol. 5, pp. 451-455). [5170576] https://doi.org/10.1109/CSIE.2009.914
Luo, Tzuo Liang ; Chen, Jian Horng ; Lai, Yuan Lung. / A rotatable placement algorithm and GA to the nesting problem. 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. Vol. 5 2009. pp. 451-455
@inproceedings{f9d47503a11844e39b89c60fd7cd75fb,
title = "A rotatable placement algorithm and GA to the nesting problem",
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. 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.",
author = "Luo, {Tzuo Liang} and Chen, {Jian Horng} and Lai, {Yuan Lung}",
year = "2009",
month = "11",
day = "16",
doi = "10.1109/CSIE.2009.914",
language = "English",
isbn = "9780769535074",
volume = "5",
pages = "451--455",
booktitle = "2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009",

}

Luo, TL, Chen, JH & Lai, YL 2009, A rotatable placement algorithm and GA to the nesting problem. in 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. vol. 5, 5170576, pp. 451-455, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, Los Angeles, CA, United States, 09-03-31. https://doi.org/10.1109/CSIE.2009.914

A rotatable placement algorithm and GA to the nesting problem. / Luo, Tzuo Liang; Chen, Jian Horng; Lai, Yuan Lung.

2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. Vol. 5 2009. p. 451-455 5170576.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A rotatable placement algorithm and GA to the nesting problem

AU - Luo, Tzuo Liang

AU - Chen, Jian Horng

AU - Lai, Yuan Lung

PY - 2009/11/16

Y1 - 2009/11/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71049165609&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049165609&partnerID=8YFLogxK

U2 - 10.1109/CSIE.2009.914

DO - 10.1109/CSIE.2009.914

M3 - Conference contribution

SN - 9780769535074

VL - 5

SP - 451

EP - 455

BT - 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009

ER -

Luo TL, Chen JH, Lai YL. A rotatable placement algorithm and GA to the nesting problem. In 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. Vol. 5. 2009. p. 451-455. 5170576 https://doi.org/10.1109/CSIE.2009.914