A Revised Version of Ant Colony Algorithm for One-Dimensional Cutting Stock Problem

Authors

  • Kourosh Eshghi Sharif University of Technology
  • Hasan Javanshir Islamic Azad University

DOI:

https://doi.org/10.23055/ijietap.2008.15.4.181

Keywords:

One-dimensional cutting stock problem, trim loss problem, ant colony optimization

Abstract

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.

Author Biographies

Kourosh Eshghi, Sharif University of Technology

K

Hasan Javanshir, Islamic Azad University

Hasan Javanshir is an Assistant Professor of Industrial Engineering Department at Islamic Azad University, South Tehran Branch. He received his Ph.D. in Industrial Engineering from Islamic Azad University in 2006. His research interests include mathematical programming, transportation planning and applications of operations reserach. He is the author of 2 books and over 40 journal papers.

Downloads

Published

2022-02-26

How to Cite

Eshghi, K., & Javanshir, H. (2022). A Revised Version of Ant Colony Algorithm for One-Dimensional Cutting Stock Problem. International Journal of Industrial Engineering: Theory, Applications and Practice, 15(4), 341–348. https://doi.org/10.23055/ijietap.2008.15.4.181

Issue

Section

Operation Research