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 |