Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 A simulated annealing heuristic for the one-dimensional cutting stock problem
作者 陳春龍
Chen, Chuen-Lung;Hart, Stephen M.;Tham, Wai Mui
貢獻者 資管系
關鍵詞 Cutting stock problem; Simulated annealing; Integer linear programming; Optimization
日期 1996-09
上傳時間 12-Feb-2015 14:20:08 (UTC+8)
摘要 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.
關聯 European Journal of Operational Research,93,522-535
資料類型 article
DOI http://dx.doi.org/10.1016/0377-2217(95)00102-6
dc.contributor 資管系-
dc.creator (作者) 陳春龍-
dc.creator (作者) Chen, Chuen-Lung;Hart, Stephen M.;Tham, Wai Mui-
dc.date (日期) 1996-09-
dc.date.accessioned 12-Feb-2015 14:20:08 (UTC+8)-
dc.date.available 12-Feb-2015 14:20:08 (UTC+8)-
dc.date.issued (上傳時間) 12-Feb-2015 14:20:08 (UTC+8)-
dc.identifier.uri (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 (資料類型) articleen
dc.identifier.doi (DOI) 10.1016/0377-2217(95)00102-6en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1016/0377-2217(95)00102-6 en_US