Loading...

A revised version of ACO for cutting stock problem [electronic resource]

Eshghi, K. (Kourosh) ; Sharif University of Technology

289 Viewed
  1. Type of Document: Article
  2. Abstract:
  3. The one-dimensional cutting stock problem has many applications in industries and during the past few years has been one of the centers of attention among the researchers in the field of applied operations research. In this paper, a revised version of Ant Colony Optimization (ACO) technique is presented to solve this problem. This paper is a sequel to the previous ACO algorithm presented by the authors. In this algorithm, according to some probabilistic rules, artificial ants will select cutting patterns and generate a feasible solution. Computational results show the high efficiency and accuracy of the proposed algorithm for solving one- dimensional cutting stock problem
  4. Keywords:
  5. One-dimensional cutting stock problem ; Trim loss problem ; Ant colony optimization
  6. Source: International Journal of Industrial Engineering ; Vol 15, No 4 (2008), Pages 341-348
  7. URL: http://journals.sfu.ca/ijietap/index.php/ijie/article/view/181