A SIMULATED ANNEALING HEURISTIC FOR THE ONE-DIMENSIONAL CUTTING STOCKPROBLEM

This paper presents a new simulated annealing approach to the solution of an integer linear programming formulation of the one-dimensional c utting stock problem. Design and implementation issues are discussed - including a thorough statistical analysis of the effects of various p arameters on the efficiency and accuracy of solutions. The performance of the new algorithm is compared to that obtained using an existing s imulated annealing based methodology, and results presented herein ind icate that the new approach consistently generates more efficient solu tions with respect to objective value and execution time.