Paper cutting optimization using simulated annealing

This article presents the use of the simulated annealing algorithm to solve the waste minimization problem in roll cutting programming, in this case, paper. Client orders, which vary in weight, width, and external and internal diameter, are fully satisfied; and no cuts to inventory are additionally generated, unless, they are specified. Once an optimal cutting program is obtained, the algorithm is applied again to minimize cutting blade movements. Several tests were performed with real data from a paper company in which an average of 30% waste reduction and 100% in production to inventory are obtained compare to the previous procedure. Actual savings represent about $5,200,000 USD in four months with 4 cutting machines.