Particle swarm optimization approach for resolving the cutting stock problem
- 1 May 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 259-263
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Particle swarm optimization2014
- A particle swarm optimization approach for the bi-objective load balancing problemElectronic Notes in Discrete Mathematics, 2010
- A Heuristic Particle Swarm Optimization for Cutting Stock Problem Based on Cutting PatternLecture Notes in Computer Science, 2007
- Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problemComputers & Operations Research, 1997
- Heuristics for the integer one-dimensional cutting stock problem: A computational studyOR Spectrum, 1996
- A hybrid grouping genetic algorithm for bin packingJournal of Heuristics, 1996
- Algorithms for the Container Loading Problem1992