Santoso, Mersilia Amandani (2017) Implementation of Optimizing Two-dimensional Guillotine Cut by Genetic Algorithm. Other thesis, Unika Soegijapranata Semarang.
|
Text (COVER)
12.02.0008 Mersilia Amandani Santoso COVER.pdf Download (803kB) | Preview |
|
|
Text (BAB I)
12.02.0008 Mersilia Amandani Santoso BAB I.pdf Download (815kB) | Preview |
|
![[img]](https://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (BAB II)
12.02.0008 Mersilia Amandani Santoso BAB II.pdf Restricted to Registered users only Download (860kB) |
|
|
Text (BAB III)
12.02.0008 Mersilia Amandani Santoso BAB III.pdf Download (828kB) | Preview |
|
|
Text (BAB IV)
12.02.0008 Mersilia Amandani Santoso BAB IV.pdf Download (893kB) | Preview |
|
|
Text (BAB V)
12.02.0008 Mersilia Amandani Santoso BAB V.pdf Download (1MB) | Preview |
|
|
Text (BAB VI)
12.02.0008 Mersilia Amandani Santoso BAB VI.pdf Download (822kB) | Preview |
|
|
Text (DAFTAR PUSTAKA)
12.02.0008 Mersilia Amandani Santoso DAFTAR PUSTAKA.pdf Download (822kB) | Preview |
|
|
Text (LAMPIRAN)
12.02.0008 Mersilia Amandani Santoso LAMPIRAN.pdf Download (1MB) | Preview |
Abstract
Cutting two-dimensional sheet into a many rectangular parts with different size need complex layout arrangement. One method to optimizing the layout is guillotine cut. In guillotine cut, some rectangular parts cut edge to edge on a sheet. Guillotine cut layout algorithm processes the layout arrangement in order to make guillotine cut possible. To complete the guillotine cut, the arrangement is optimizes by genetic algorithm to make optimum waste area persentage (lowest persentage). This program reads the weight, length, and ID number of some rectangular parts from txt file. Next step, the program saves the rectangles data (number) from txt file into array. The genetic algorithm reads ID data from array and shuffles the sequence. After ID data sequence shuffled, program sents rectangles data to guillotine cut layout algorithm. The guillotine cut layout algorithm changes rectangles data into rectangles shapes (picture) and enter it in a two-dimensional sheet sequentially. The layout arrangement is following new sequence ID data which already shuffled before. Not necessarily all rectangles can entered in a sheet. There is a logic in guillotine cut algorithm which only save entered ID number and count total waste area after the rectangles entered. Genetic algorithm will generating 1000 times and save all waste area persentage. Final step, is searching the optimum persentage with most total ID number of rectangles then the program will show one of layout picture which has optimum result as an output.
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 600 Technology (Applied sciences) > 620 Engineering > 621 Electrical engineering |
| Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
| Depositing User: | Mrs Christiana Sundari |
| Date Deposited: | 17 Oct 2017 05:43 |
| Last Modified: | 30 May 2022 03:53 |
| URI: | http://repository.unika.ac.id/id/eprint/14883 |
Actions (login required)
 |
View Item |
