We propose in this paper a one dimensional cutting stock problem encountered in a large manufacturer of multi-usable cables. The problem consists in the post-production process where a variety of orders of multi-sized sets of cables should be satisfied. We developed a solution method based on a particle swarm optimization approach that takes into account the characteristics of the specific problem. We assume that the manufacture produce cables sets having the same length. The reduction of the wastage is tackled which is successfully tested in this paper. A mathematical model of the problem is developed, and results on a wide variety of instances and comparisons with other works found in the literature are presented to illustrate the effectiveness of our algorithm in solving the cutting stock problem.
Particle swarm optimization approach for resolving the cutting stock problem
2014-05-01
741504 byte
Conference paper
Electronic Resource
English
AIAA | 2003
|British Library Conference Proceedings | 2002
|AIAA | 2002
|Particle Swarm Optimization Algorithm for Drilling Path Planning Problem
British Library Online Contents | 2008
|Optimization for One-Dimensional Cutting-Stock Problem Based on Genetic
British Library Online Contents | 2002
|