i-manager Publications

A New Algorithm for the One-Dimensional Cutting Stock Problem

Sarath. B. Siyambalapitiya*

*Faculty of Engineering, University of Peradeniya, Peradeniya, Sri Lanka.

Periodicity:November - January'2006
DOI : https://doi.org/10.26634/jfet.1.2.963

Abstract

A fast heuristic algorithm for the solution of one dimensional cutting stock problem which has a wide variety of applications in industrial production planning is presented in this paper. In contrast to common linear programming relaxation methods, a procedure which retains the integrality requirements at each iteration is presented here. Instead of minimizing the trim loss, minimization of the number of stock pieces required to satisfy a given demand is considered.

Keywords

How to Cite this Article?

Sarath B. Siyambalapitiya (2006). A New Algorithm For The One-Dimensional Cutting Stock Problem. i-manager’s Journal on Future Engineering and Technology, 1(2), 78-84. https://doi.org/10.26634/jfet.1.2.963

References

[1] Bazaraa,M. S. , Jarvis, J.J. , and Sherali, H.D. (1990), Linear Programming and Network Flows, John Wiley and Sons.

[2] Dyckhoff, H. (1981), A new linear approach to the cutting stock problem,Operations Research, 29, pp. 1092-1104.

[3] Gilmore, P.C. and Gomory, R.E. (1961), A linear programming approach to the cutting-stock problem, Operations Research, 9, pp.849-859.

[4] Hadley ,G. (1962), Linear Algebra, Addison-Wesley Publishing Company.

[5] Haessler, R.W. (1975), Controlling cutting pattern changes in one-dimensional trim problems, Operations Research, 1975, 23, pp. 483-493.

[6] Scheithauer,D. and Terno, J. (1995), A branch & bound algorithm for solving one-dimensional cutting stock problems exactly, Applicationes Mathematicae, 23 (2), pp.151-167.

[7] Umetani, S.(2003), Combinatorial optimization and algorithms: Research topics, http://www.toyotati. ac.jp/Lab/Kikai/5k40/cad/umetani/index-e.html

[8] Umetani, S. , Yagiura,M. and Ibaraki, T. (2003), An LPbased local search to the one dimensional cutting stock problem using a given number of cutting patterns, IEICE Transacs. Fundamentals , E86-A, pp. 1093-1102.

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25

A New Algorithm for the One-Dimensional Cutting Stock Problem

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: