A CAM system for one-dimensional stock cutting

Authors:
Yaodong Cui
Affiliations:
School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China
Venue:
Advances in Engineering Software
Year:
2012

Citing 6
Cited 0

Pattern minimisation in cutting stock problems

Discrete Applied Mathematics
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

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

Computers and Operations Research
A hybrid heuristic to reduce the number of different patterns in cutting stock problems

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Solving a combined cutting-stock and lot-sizing problem with a column generating procedure

Computers and Operations Research
C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction

Optimization Methods & Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the one-dimensional cutting stock problem in which m types of items are cut from stock bars of multiple sizes such that the bar cost is minimized. A solution to this problem is a cutting plan consisting of a set of cutting patterns with specified frequency. A CAM system based on a sequential heuristic procedure is developed for generating cutting plans. The algorithm takes the reduction of bar cost as the primary objective, and considers two secondary objectives - pattern reduction and shorter stocks reduction. The system provides a set of non-dominated cutting plans so that the most appropriate one can be selected according to the specified circumstance. Computational results indicate that the algorithm can generate solutions comparable to or better than those of previously published algorithms that consider pattern reduction.