An area-decomposition method for a nesting system

Yuan Lung Lai, Jian Horng Chen, Tzuo Liang Luo

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

Abstract

Nesting is primarily composed of two processes: One is the determination of permutation; another is the placement for the pieces unto the sheet. These two processes determine the quality for nesting. If the permutation is right and placement also can satisfy the requirements, then we can locate the proper solution or the optimum one; but most of the time, there is no way to know the correct permutation beforehand, therefore the search algorithm is needed to locate the optimum solution instead. Nonetheless, if the placement is not good enough, even the permutation is correct; still, the nesting result would not be perfect. Hence this research is to target the nesting requirement for pieces with gaps in between and develop the placement algorithm of innovation which integrates the simulated annealing characteristics so as to proceed to the optimum solution for nesting system with the best possible nesting results. The purpose of optimizing two-dimensional problem is to place the same or different number of pieces onto the sheet, enabling the usage ratio for sheet reaching the highest possible or cutting down the waste in the end, thus, with the high usage ratio of the sheet would result with cutting down the cost for materials.

Original languageEnglish
Title of host publication2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009
Pages392-396
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

Decomposition
Simulated annealing
Innovation
Costs

All Science Journal Classification (ASJC) codes

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

Cite this

Lai, Y. L., Chen, J. H., & Luo, T. L. (2009). An area-decomposition method for a nesting system. In 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 (Vol. 5, pp. 392-396). [5170565] https://doi.org/10.1109/CSIE.2009.1098
Lai, Yuan Lung ; Chen, Jian Horng ; Luo, Tzuo Liang. / An area-decomposition method for a nesting system. 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. Vol. 5 2009. pp. 392-396
@inproceedings{c3b9c066590d4ed5ab98ce66632cb584,
title = "An area-decomposition method for a nesting system",
abstract = "Nesting is primarily composed of two processes: One is the determination of permutation; another is the placement for the pieces unto the sheet. These two processes determine the quality for nesting. If the permutation is right and placement also can satisfy the requirements, then we can locate the proper solution or the optimum one; but most of the time, there is no way to know the correct permutation beforehand, therefore the search algorithm is needed to locate the optimum solution instead. Nonetheless, if the placement is not good enough, even the permutation is correct; still, the nesting result would not be perfect. Hence this research is to target the nesting requirement for pieces with gaps in between and develop the placement algorithm of innovation which integrates the simulated annealing characteristics so as to proceed to the optimum solution for nesting system with the best possible nesting results. The purpose of optimizing two-dimensional problem is to place the same or different number of pieces onto the sheet, enabling the usage ratio for sheet reaching the highest possible or cutting down the waste in the end, thus, with the high usage ratio of the sheet would result with cutting down the cost for materials.",
author = "Lai, {Yuan Lung} and Chen, {Jian Horng} and Luo, {Tzuo Liang}",
year = "2009",
month = "11",
day = "16",
doi = "10.1109/CSIE.2009.1098",
language = "English",
isbn = "9780769535074",
volume = "5",
pages = "392--396",
booktitle = "2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009",

}

Lai, YL, Chen, JH & Luo, TL 2009, An area-decomposition method for a nesting system. in 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. vol. 5, 5170565, pp. 392-396, 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.1098

An area-decomposition method for a nesting system. / Lai, Yuan Lung; Chen, Jian Horng; Luo, Tzuo Liang.

2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. Vol. 5 2009. p. 392-396 5170565.

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

TY - GEN

T1 - An area-decomposition method for a nesting system

AU - Lai, Yuan Lung

AU - Chen, Jian Horng

AU - Luo, Tzuo Liang

PY - 2009/11/16

Y1 - 2009/11/16

N2 - Nesting is primarily composed of two processes: One is the determination of permutation; another is the placement for the pieces unto the sheet. These two processes determine the quality for nesting. If the permutation is right and placement also can satisfy the requirements, then we can locate the proper solution or the optimum one; but most of the time, there is no way to know the correct permutation beforehand, therefore the search algorithm is needed to locate the optimum solution instead. Nonetheless, if the placement is not good enough, even the permutation is correct; still, the nesting result would not be perfect. Hence this research is to target the nesting requirement for pieces with gaps in between and develop the placement algorithm of innovation which integrates the simulated annealing characteristics so as to proceed to the optimum solution for nesting system with the best possible nesting results. The purpose of optimizing two-dimensional problem is to place the same or different number of pieces onto the sheet, enabling the usage ratio for sheet reaching the highest possible or cutting down the waste in the end, thus, with the high usage ratio of the sheet would result with cutting down the cost for materials.

AB - Nesting is primarily composed of two processes: One is the determination of permutation; another is the placement for the pieces unto the sheet. These two processes determine the quality for nesting. If the permutation is right and placement also can satisfy the requirements, then we can locate the proper solution or the optimum one; but most of the time, there is no way to know the correct permutation beforehand, therefore the search algorithm is needed to locate the optimum solution instead. Nonetheless, if the placement is not good enough, even the permutation is correct; still, the nesting result would not be perfect. Hence this research is to target the nesting requirement for pieces with gaps in between and develop the placement algorithm of innovation which integrates the simulated annealing characteristics so as to proceed to the optimum solution for nesting system with the best possible nesting results. The purpose of optimizing two-dimensional problem is to place the same or different number of pieces onto the sheet, enabling the usage ratio for sheet reaching the highest possible or cutting down the waste in the end, thus, with the high usage ratio of the sheet would result with cutting down the cost for materials.

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

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

U2 - 10.1109/CSIE.2009.1098

DO - 10.1109/CSIE.2009.1098

M3 - Conference contribution

AN - SCOPUS:71049168435

SN - 9780769535074

VL - 5

SP - 392

EP - 396

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

ER -

Lai YL, Chen JH, Luo TL. An area-decomposition method for a nesting system. In 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009. Vol. 5. 2009. p. 392-396. 5170565 https://doi.org/10.1109/CSIE.2009.1098