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: | Ding-Ren Chen, 陳薡任 |
---|---|
Other Authors: | Lang-Lung Lai |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/43199629681183224438 |
Similar Items
-
Simulated Annealing Algorithms for Discrete Simulation Optimization Problems
by: Jung-Pin Chiu, et al.
Published: (2004) -
Low bending loss few-mode hollow-core anti-resonant fiber with glass-sheet conjoined nested tubes
by: Chen, D., et al.
Published: (2022) -
A Simulated Annealing Approach for the Train Design Optimization Problem
by: Federico Alonso-Pecina, et al.
Published: (2017-01-01) -
Simulated Annealing : Simulated Annealing for Large Scale Optimization in Wireless Communications
by: Sakhavat, Tamim, et al.
Published: (2012) -
Solving Cell Formation Problem by Simulated annealing
by: 陳民葵
Published: (2002)