PENYELESAIAN ALGORITMA PATTERN GENERATION DENGAN MODEL ARC-FLOW PADA CUTTING STOCK PROBLEM (CSP) SATU DIMENSI

APRIANI, RIKA and Bangun, Putra Bahtera Jaya and Octarina, Sisca (2016) PENYELESAIAN ALGORITMA PATTERN GENERATION DENGAN MODEL ARC-FLOW PADA CUTTING STOCK PROBLEM (CSP) SATU DIMENSI. Undergraduate thesis, Sriwijaya University.

Preview	Text RAMA_44201_08121001045_0004095905_0003098401_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (682kB) | Preview
	Text RAMA_44201_08121001045_0004095905_0003098401_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (454kB) | Request a copy
	Text RAMA_44201_08121001045_0004095905_0003098401_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (176kB) | Request a copy
	Text RAMA_44201_08121001045_0004095905_0003098401_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_44201_08121001045_0004095905_0003098401_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (88kB) | Request a copy
	Text RAMA_44201_08121001045_0004095905_0003098401_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (144kB) | Request a copy

Abstract

One-dimensional Cutting Stock Problem (CSP) is one of the optimization problem in the case of combining cutting patterns. This research used Pattern Generation algorithm and Arc-Flow model to solve the optimal pattern cutting in wood cutting problem at Depot Kusen Mitra Vanay. According to the result and discussion, if the problem was solved using Pattern Generation, there were 36 cutting patterns with 0 meter cut loss which will be formed in Arc-Flow model. Arc-Flow model which was formed only used demand fulfillment constraint and nonnegative constraint, while the constraint about flow conservation was not used. Optimal solution in CSP Depot Kusen Mitra Vanay with that 4 meters longth standard is used to fulfill the consumer order. Optimal patterns that used are of 82 times of 2nd cutting pattern, twice of 3rd cutting pattern, once of 4th cutting pattern and 21 times of 9th cutting pattern.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Cutting Stock Problem (CSP), Pattern Generation Algorithm, Arc-Flow Model, Branch and Bound
Subjects:	Q Science > QA Mathematics > QA101-(145) Elementary mathematics. Arithmetic Q Science > QA Mathematics > QA8.9-QA10.3 Computer science. Artificial intelligence. Computational complexity. Data structures (Computer scienc. Mathematical Logic and Formal Languages
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Dies Meirita Sari
Date Deposited:	19 Nov 2019 03:38
Last Modified:	19 Nov 2019 03:38
URI:	http://repository.unsri.ac.id/id/eprint/17044

Actions (login required)

View Item