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 language | English |
|---|---|
| Title of host publication | 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 |
| Pages | 392-396 |
| Number of pages | 5 |
| Volume | 5 |
| DOIs | |
| Publication status | Published - 2009 Nov 16 |
| Event | 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 - Los Angeles, CA, United States Duration: 2009 Mar 31 → 2009 Apr 2 |
Other
| Other | 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009 |
|---|---|
| Country | United States |
| City | Los Angeles, CA |
| Period | 09-03-31 → 09-04-02 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Hardware and Architecture
- Information Systems
- Software
Cite this
}
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 proceeding › Conference 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 -