IMPLEMENTASI COLUMN GENERATION TECHNIQUE DAN ALGORITMA BALAS YANG DIKEMBANGKAN DALAM PENYELESAIAN CUTTING STOCK PROBLEM (CSP) SATU DIMENSI

SETIADI, DANNI and Octarina, Sisca and Bangun, Putra Bahtera Jaya (2015) IMPLEMENTASI COLUMN GENERATION TECHNIQUE DAN ALGORITMA BALAS YANG DIKEMBANGKAN DALAM PENYELESAIAN CUTTING STOCK PROBLEM (CSP) SATU DIMENSI. Undergraduate thesis, Sriwijaya University.

	Text RAMA_44201_08111001046.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (2MB) | Request a copy
Preview	Text RAMA_44201_08111001046_0003098401_0004095905_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (434kB) | Preview
	Text RAMA_44201_08111001046_0003098401_0004095905_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (396kB) | Request a copy
	Text RAMA_44201_08111001046_0003098401_0004095905_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (195kB) | Request a copy
	Text RAMA_44201_08111001046_0003098401_0004095905_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (892kB) | Request a copy
	Text RAMA_44201_08111001046_0003098401_0004095905_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (86kB) | Request a copy
	Text RAMA_44201_08111001046_0003098401_0004095905_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (138kB) | Request a copy

Abstract

One-dimensional Cutting Stock Problem (CSP) is one of the optimization problem in the case of combining cutting patterns. This study used Column Generation Technique (CGT) and the Balas algorithm developed to solve the optimal cutting pattern of one-dimensional CSP on two problems. Based on the results and discussion, if problem-1 using CGT, the optimal cutting pattern was as much as 31 flyer, while Balas algorithm developed did not produce an optimal solution because the solution was not binary. The optimal cutting pattern in problem-2 were the first cutting pattern which produced 1 roll of 7 metres length and 1 roll of 3 metres length, the third cutting pattern which produced 2 roll of 3 metres length and 1 roll of 4 metres length, the fourth cutting pattern which produced 2 roll of 4 metres length. While Balas algorithm developed generated first, second, and fourth cutting pattern as the optimal solution.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Cutting Stock Problem (CSP), Column Generation Technique (CGT) Balas Algorithm Developed, Integer Linear Programming
Subjects:	Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics Q Science > QA Mathematics > QA1-939 Mathematics > QA612 Mathematica (Computer file) Algebraic topology. Group theory. Manifolds (Mathematics)
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Dies Meirita Sari
Date Deposited:	26 Nov 2019 07:13
Last Modified:	26 Nov 2019 07:13
URI:	http://repository.unsri.ac.id/id/eprint/18486

Actions (login required)

View Item