The trim loss concentration in one-dimensional cutting stock problem (lD-CSP) by defining a virtual cost

Nowadays, one-dimensional cutting stock problem (1d-csp) is used in many industrial processes and recently has been considered as one of the most important research topic. in this paper, a metaheuristic algorithm based on the simulated annealing (sa) method is represented to minimize the trim loss and also to focus the trim loss on the minimum number of large objects. in this method, the id-csp is taken into account as item-oriented and the authors have tried to minimize the trim loss concentration by using the simulated annealing algorithm and also defining a virtual cost for the trim loss of each stock. the solved sample problems show the ability of this algorithm to solve the id-csp in many cases.