A Heuristic Particle Swarm Optimization for Cutting Stock Problem Based on Cutting Pattern

Authors:
Xianjun Shen;Yuanxiang Li;Jincai Yang;Li Yu
Affiliations:
Department of Computer Science, Central China Normal University, Wuhan 430079, China and State Key Lab of Software Engineering, Wuhan University, Wuhan 430072, China;State Key Lab of Software Engineering, Wuhan University, Wuhan 430072, China;Department of Computer Science, Central China Normal University, Wuhan 430079, China;State Key Lab of Software Engineering, Wuhan University, Wuhan 430072, China
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Year:
2007

Citing 1
Cited 1

A combined approach to the solution to the general one-dimensional cutting stock problem

Computers and Operations Research

Artificial fish swarm algorithm for two-dimensional non-guillotine cutting stock problem

ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic particle swarm optimization (HPSO) is proposed as a solution to one-dimensional cutting stock problem (1D-CSP), which incorporate genetic operators into particle swarm optimization (PSO). In this paper, a heuristic strategy that is based on the results of analysis of the optimal cutting pattern of particles with successful search processes is described, which process a global optimization problem of the cutting-stock as a sequential optimization problem by multiple stages. During every sequential stage, the best cutting pattern for the current situation is researched and processed. This strategy is repeated until all the required stocks have been generated. The simulation results prove the effectiveness of the proposed methodology.