Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/73500


Title: A simulated annealing heuristic for the one-dimensional cutting stock problem
Authors: 陳春龍
Chen, Chuen-Lung;Hart, Stephen M.;Tham, Wai Mui
Contributors: 資管系
Keywords: Cutting stock problem;Simulated annealing;Integer linear programming;Optimization
Date: 1996-09
Issue Date: 2015-02-12 14:20:08 (UTC+8)
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.
Relation: European Journal of Operational Research,93,522-535
Data Type: article
DOI 連結: http://dx.doi.org/10.1016/0377-2217(95)00102-6
Appears in Collections:[資訊管理學系] 期刊論文

Files in This Item:

File Description SizeFormat
522-535.pdf948KbAdobe PDF1337View/Open


All items in 學術集成 are protected by copyright, with all rights reserved.


社群 sharing