Optimasi Minimum Pola Baju Khas Kain Tenun Sarung Samarinda Menggunakan Algoritma Greedy
Nowadays, the typical clothes of the Samarinda sarong woven cloth have become a secondary requirement in the daily activities of the people in Samarinda City. In making the typical woven cloth, the sarong of Samarinda requires a sufficient area of the woven cloth to attach it to the pattern of clothes of various sizes. This research requires an appropriate method in measuring the area of woven fabric required for the installation of clothing patterns of various sizes, namely by using the greedy algorithm. Greedy algorithm is the right method to solve optimization problems, including the size of the fabric. With the method used, it is indicated that it can make it easier for producers or makers of typical clothes patterns for the Samarinda sarong woven cloth to find out the size of the woven cloth they need. Therefore, in this study several stages were carried out, including the first stage analyzing the medium-sized clothing pattern, the second stage measuring the area of each pattern on the shirt section, and the third stage installing a medium-sized pattern on the woven cloth typical of Samarinda sarong by optimizing the width of the cloth. there is. The application of the typical cloth woven sarong pattern of Samarinda by using the greedy algorithm on the medium size can be concluded to be able to optimize the use of these fabrics. This systematic stage can make it easier for producers or makers of typical Samarinda sarong woven cloth to utilize the woven fabric to the minimum so that there is no waste of the Samarinda sarong woven fabric. Keywords: Shirt, Typical fabric woven sarong Samarinda, Patterns, Greedy Algorithm
Full Text:PDF (Indonesian)
Bednorz, W. (2008). Advaces in Greedy Algorithms. Croatia: In-Tech.
Bellman, R. (1957). Dynamic Programming. New Jersey: Princeton University Press.
J.A. Bony and Murty, U. S. R (1976). Graph Theory With Application. Ontario: North- Holland.
Jungnickel, D. (2008). Graphs, Network and Algorithms Third Edition. Germany: Springer.
Munir, R. (2011). Diktat Kuliah IFF2251 (Algoritma Greedy) Strategy Algoritmik. Bandung: Program Studi Informatika. Sekolah Teknik Elektro dan Informatika ITB: Tidak diterbitkan.
Neapolitan, R. dan Naimpour, K. (2011). Foundations of Algorithms Fourth Edition. Canada: Jones and Bartlett Publisher, LLC.
Suyanto. (2010). Algoritma Optimasi Deterministik atau Porbabilitik. Yogyakarta: Graha Ilmu.
Abstract 622 kali dilihat
PDF (Indonesian) 378 kali diunduh
- There are currently no refbacks.
Ciptaan disebarluaskan di bawah Lisensi Creative Commons Atribusi-NonKomersial-BerbagiSerupa 4.0 Internasional.