Judul: Penyelesaian Cutting Stock Problem Satu Dimensi Menggunakan Algoritme Particle Swarm Optimization
Abstrak: Cutting stock problem (CSP) merupakan permasalahan pemotongan persediaan yang sering dijumpai di banyak industri. Tujuannya untuk mendapatkan sisa pemotongan seminimum mungkin, namun tetap memenuhi permintaan pelanggan. Ada beberapa metode yang dapat digunakan untuk menyelesaikan permasalahan ini. Pada karya ilmiah ini, digunakan metode heuristik particle swarm optimization (PSO) sebagai penyelesaian masalah CSP. Pada tahap pertama penulis menentukan kombinasi pola pemotongan yang mungkin dapat digunakan dengan bantuan bahasa pemrograman Python. Selanjutnya, dibuat model matematis dan kendala sesuai pola yang tersedia. Kemudian, algoritme PSO digunakan untuk menentukan kombinasi pola potongan supaya menghasilkan sisa pemotongan yang paling sedikit. Diawali dengan inisialisasi parameter yang digunakan. Kemudian setelah diimplementasikan, menghasilkan kombinasi pola pemotongan rol kertas yang optimum yaitu sebanyak tiga rol untuk pola satu, 29 rol untuk pola 23, enam rol untuk pola 27 dan 29 rol untuk pola 32., Cutting stock problem (CSP) is an inventory cutting problem that is often encountered in many industries. The goal is to get the remaining cutting to a minimum, while still meeting customer demands. There are several methods that can be used to solve this problem. In this scientific paper, the heuristic particle swarm optimization (PSO) method is used to solve the CSP problem. In the first stage the author determines the possible combination of cutting patterns that can be used with the help of the Python programming language. Next, a mathematical model and constraints are made according to the available patterns. Then, the PSO algorithm is used to determine the combination of cut patterns in order to produce the least amount of cutting residue. It begins with the initialization of the parameters used. Then after it was implemented, it resulted in the optimum combination of aluminum roller cutting patterns as many as three rolls for pattern one, 29 rolls for pattern 23, six rolls for pattern 27 and 29 rolls for pattern 32.
Keyword: cutting stock problem, particle swarm optimization, trim loss

Judul: One Dimensional Cutting Stock Problem Optimization with Ant Colony Optimization
Abstrak: Cutting Stock Problem (CSP) satu dimensi merupakan permasalahan optimisasi pemotongan bahan yang berfokus pada satu pola pemotongan yaitu panjang atau lebar. Tujuannya adalah untuk menentukan pola pemotongan yang meminimumkan stok yang terpakai. Salah satu metode untuk menyelesaikan CSP yaitu metode metaheuristik. Pada penelitian ini, metode yang digunakan untuk menyelesaikan CSP satu dimensi yaitu metode metaheuristik Ant Colony Optimization (ACO). Metode ACO diimplementasikan menggunakan bantuan bahasa pemrograman Python pada kasus pemesanan kusen dengan item sebanyak 213 dan panjang stok 4000 mm. Hasil yang diperoleh yaitu pola pemotongan terbaik dengan nilai fitness tertinggi 99,848% pada parameter tingkat kepentingan relatif dari informasi heuristik yaitu 2. Stok yang terpakai sebanyak 64 kayu dan sisa pemotongan sepanjang 200 mm., One dimensional Cutting Stock Problem (CSP) is a material cutting optimization problem focusing on one cutting pattern, namely length or width. The goal is to determine a cutting pattern that minimizes used stock. One of the methods to solve CSP is the metaheuristic method. In this study, the metaheuristic method used to solve one dimensional CSP is Ant Colony Optimization (ACO). The ACO method is implemented using Python programming language in the case of ordering frames with 213 items and 4000 mm stock length. The results obtained are the best cutting pattern with the highest fitness is 99,848% at the relative importance parameter of the heuristic information is 2. The stock used is 64 wood and the trim loss is 200 mm.
Keyword: metaheuristic method, ant colony optimization, one dimensional cutting stock problem

Judul: Profil Antibodi IgM dan IgG pada Beruk (Macaca nemestrina) setelah Diinfeksi Virus Dengue Serotipe-3 (DEN-3) melalui Rute Intravena
Abstrak: The aim of this study was to detect IgM and IgG in pig-tailed macaques (Macaca nemestrina) primarily innoculated by Dengue virus serotype-3 (DEN-3) by intravenous route. A total of 84 plasma samples were examined in the study. Plasma samples were taken on day 0 before infection, followed by plasma collections on day 1 through day 13 post infection. The obtained plasma samples were analyzed using indirect ELISA test. The results showed the increasing titer of IgM started on day-3 post infection with its peak occurred on day 11 post infection and started to decline afterward; while the IgG titer started to increase on day 6 or day 7 post infection and continue to increase until the day 13 post infection. These results showed that in a primary infection of DEN-3 byintravenous route, the tendency of IgM titer increase was higher than the IgG titer increase; also shown that the IgM titer increase was occured earlier than IgG. The profile of IgM and IgG antibodies is outlined in this study.
Keyword: