Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing
碩士 === 大葉大學 === 機械與自動化工程學系 === 99 === A nesting problem can be completed by two processes; one is the determination of permutation for pieces sequences, the other one is applying placement algorithm for placing all pieces into the sheet. The two processes dominate the solution of the nesting problem...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/43199629681183224438 |
id |
ndltd-TW-099DYU00609038 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-099DYU006090382015-10-13T20:04:05Z http://ndltd.ncl.edu.tw/handle/43199629681183224438 Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing 以模擬退火處理中空基材之排版研究 Ding-Ren Chen 陳薡任 碩士 大葉大學 機械與自動化工程學系 99 A nesting problem can be completed by two processes; one is the determination of permutation for pieces sequences, the other one is applying placement algorithm for placing all pieces into the sheet. The two processes dominate the solution of the nesting problem. If the sequence of permutation and the placement rule of packing are up to standard, then the exact or optimum solutions can be found. But the problem is that we don’t know the sequence of permutation is adequate or not. Even the sequence is appropriate for the permutation, without a suitable placement algorithm the final results are also unacceptable. The objective of the two-dimensional optimal nesting problem is to determine the effective usage of the stock sheet under different considerations of pieces. Such make the material utilization rate is highest and the cost for material is therefore reduced. This research developed a new placement algorithm for pieces with gaps in nesting operations. Under this new placement algorithm, we will adopt the simulated annealing approach to optimal decision of hollow-sheets nesting systems. Lang-Lung Lai 賴元隆 2011 學位論文 ; thesis 117 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 大葉大學 === 機械與自動化工程學系 === 99 === A nesting problem can be completed by two processes; one is the determination of permutation for pieces sequences, the other one is applying placement algorithm for placing all pieces into the sheet. The two processes dominate the solution of the nesting problem. If the sequence of permutation and the placement rule of packing are up to standard, then the exact or optimum solutions can be found. But the problem is that we don’t know the sequence of permutation is adequate or not. Even the sequence is appropriate for the permutation, without a suitable placement algorithm the final results are also unacceptable. The objective of the two-dimensional optimal nesting problem is to determine the effective usage of the stock sheet under different considerations of pieces. Such make the material utilization rate is highest and the cost for material is therefore reduced. This research developed a new placement algorithm for pieces with gaps in nesting operations. Under this new placement algorithm, we will adopt the simulated annealing approach to optimal decision of hollow-sheets nesting systems.
|
author2 |
Lang-Lung Lai |
author_facet |
Lang-Lung Lai Ding-Ren Chen 陳薡任 |
author |
Ding-Ren Chen 陳薡任 |
spellingShingle |
Ding-Ren Chen 陳薡任 Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing |
author_sort |
Ding-Ren Chen |
title |
Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing |
title_short |
Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing |
title_full |
Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing |
title_fullStr |
Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing |
title_full_unstemmed |
Optimize 2D Nesting Problem for Hollow Sheets by Simulated Annealing |
title_sort |
optimize 2d nesting problem for hollow sheets by simulated annealing |
publishDate |
2011 |
url |
http://ndltd.ncl.edu.tw/handle/43199629681183224438 |
work_keys_str_mv |
AT dingrenchen optimize2dnestingproblemforhollowsheetsbysimulatedannealing AT chéndǐngrèn optimize2dnestingproblemforhollowsheetsbysimulatedannealing AT dingrenchen yǐmónǐtuìhuǒchùlǐzhōngkōngjīcáizhīpáibǎnyánjiū AT chéndǐngrèn yǐmónǐtuìhuǒchùlǐzhōngkōngjīcáizhīpáibǎnyánjiū |
_version_ |
1718043444398522368 |