Javanshir, H., Shadalooee, M. (2007). The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost. Journal of Industrial Engineering, International, 3(4), 51-58.
H Javanshir; M Shadalooee. "The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost". Journal of Industrial Engineering, International, 3, 4, 2007, 51-58.
Javanshir, H., Shadalooee, M. (2007). 'The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost', Journal of Industrial Engineering, International, 3(4), pp. 51-58.
Javanshir, H., Shadalooee, M. The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost. Journal of Industrial Engineering, International, 2007; 3(4): 51-58.
The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
1Assistant Professor, Dep. of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
2M.Sc., Dep. of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
Abstract
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.
Top