%0 Journal Article
%T The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
%J Journal of Industrial Engineering, International
%I Islamic Azad University, South Tehran Branch
%Z 1735-5702
%A Javanshir, H
%A Shadalooee, M
%D 2007
%\ 04/01/2007
%V 3
%N 4
%P 51-58
%! The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
%K One-dimensional cutting stock problem
%K Simulated Annealing
%K Trim loss concentration
%K Item-oriented
%K FDD algorithm
%K Virtual cost
%R
%X Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-CSP is taken into account as Item-oriented and the authors have tried to minimize the trim loss concentration by using the simulated an-nealing 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 1D-CSP in many cases.
%U http://jiei.azad.ac.ir/article_511089_882ea1f9ddf88e2be439479d9c01bcd2.pdf