An ACO algorithm for one-dimensional cutting stock problem
محورهای موضوعی : Mathematical Optimization
K Eshghi
1
(Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran)
H Javanshir
2
(Islamic Azad University, Science and Research Branch, Tehran, Iran)
کلید واژه: Ant colony optimization, One-dimensional cutting stock problem, Trim loss,
چکیده مقاله :
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the best patterns. Also because of the problem framework, effective improvements has been made to problem solving process. The results of that algorithm in sample problems, show high efficiency of the algorithm in different levels of problems.
