Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/73500
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | - |
dc.creator | 陳春龍 | - |
dc.creator | Chen, Chuen-Lung;Hart, Stephen M.;Tham, Wai Mui | - |
dc.date | 1996-09 | - |
dc.date.accessioned | 2015-02-12T06:20:08Z | - |
dc.date.available | 2015-02-12T06:20:08Z | - |
dc.date.issued | 2015-02-12T06:20:08Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/73500 | - |
dc.description.abstract | This paper presents a new simulated annealing approach to the solution of an integer linear programming formulation of the one-dimensional cutting stock problem. Design and implementation issues are discussed - including a thorough statistical analysis of the effects of various parameters on the efficiency and accuracy of solutions. The performance of the new algorithm is compared to that obtained using an existing simulated annealing based methodology, and results presented herein indicate that the new approach consistently generates more efficient solutions with respect to objective value and execution time. | - |
dc.format.extent | 971509 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | European Journal of Operational Research,93,522-535 | - |
dc.subject | Cutting stock problem; Simulated annealing; Integer linear programming; Optimization | - |
dc.title | A simulated annealing heuristic for the one-dimensional cutting stock problem | - |
dc.type | article | en |
dc.identifier.doi | 10.1016/0377-2217(95)00102-6 | en_US |
dc.doi.uri | http://dx.doi.org/10.1016/0377-2217(95)00102-6 | en_US |
item.cerifentitytype | Publications | - |
item.grantfulltext | restricted | - |
item.fulltext | With Fulltext | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
522-535.pdf | 948.74 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.