Judul: Solving 0-1 Knapsack Problem Using Migrating Birds Optimization Algorithm and Particle Swarm Optimization Algorithm
Abstrak: Masalah knapsack merupakan permasalahan optimisasi kombinatorial yang diklasifikasikan sebagai NP-complete problem. Tujuannya adalah untuk memperoleh keuntungan maksimum tanpa melebihi kapasitas knapsack dengan objek yang dipilih. Ada beberapa metode yang dikembangkan untuk permasalahan ini, salah satunya adalah metode meta-heuristic. Pada karya ilmiah ini, digunakan metode meta-heuristic migrating birds optimization (MBO) dan particle swarm optimization (PSO) untuk menyelesaikan masalah knapsack. Hasil yang diperoleh menunjukkan bahwa algoritme MBO menghasilkan keuntungan yang relatif lebih besar dibandingkan algoritme PSO., Knapsack problem is a combinatorial optimization problem which is classified as an NP-complete problem. Its aim is to achieve maximum benefit without exceeding the capacity of the knapsack with the selected objects. There are several methods developed for this problem, one of them is a meta-heuristic method. In this manuscript, migrating birds optimization (MBO) and particle swarm optimization (PSO) as meta-heuristic methods will be used to solve the knapsack problem. The result obtained shows that the MBO algorithm produces a relatively larger benefit than the PSO algorithm.
Keyword: knapsack problem, meta-heuristic method, migrating birds optimization, particle swarm optimization

Judul: Solving Travelling Salesman Problem Using  Ant Colony Optimization and Particle Swarm Optimization Algorithm
Abstrak: Travelling Salesman Problem (TSP) adalah salah satu permasalahan distribusi yang sering kali ditemui. Penyelesaian dari permasalahan dalam Travelling Salesman Problem ini adalah mencari rute terpendek atau jarak minimum. Terdapat beberapa metode yang dikembangkan untuk menyelesaikan permasalahan ini. Mulai dari metode eksak hingga metode modern atau meta heuristic. Dalam penelitian ini, dua metode heuristik digunakan untuk menyelesaikan Travelling Salesman Problem (TSP), yaitu Particle Swarm Optimization (PSO) dan Ant Colony Optimization (ACO). Solusi yang diperoleh kemudian dibandingkan dengan menggunakan metode eksak dalam bentuk Mixed-Integer Linear Programming (MILP). Hasil yang didapat menunjukkan waktu eksekusi metode Particle Swarm Optimization lebih baik daripada metode Mixed-Integer Linear Programming dan algoritme Ant Colony Optimization (ACO). Namun, ada perbedaan yang mencolok dari ketiga metode dalam total jarak perjalanan., The Travelling Salesman Problem (TSP) is one of the distribution problems that is often encountered. The solution of TSP is to find the shortest route or minimum distance. Several methods have been developed to solve this problem. Starting from exact methods to modern methods or meta heuristics. In this study, two heuristic methods will be used to solve TSP, Particle Swarm Optimization and Ant Colony Optimization. The solution obtained will be compared with the solution obtained using the exact method in the form of Mixed-Integer Linear Programming (MILP). The results obtained show that the execution time of the Particle Swarm Optimization method is better than the Mixed-Integer Linear Programming method and Ant Colony Optimization algorithm. However, there is a significant difference among the three methods in the total travel distance.
Keyword: ant colony optimization, integer linear programming, particle swarm  optimization, particle swarm  optimization

Judul: Elektrodeposisi Film Tipis Semikonduktor Cu2ZnSnS4 (CZTS) pada Substrat Kaca ITO
Abstrak: Semiconductor Cu2ZnSnS4 (CZTS) thin film that can be used as absorber layers on solar cell module was made via electrodeposition method. CZTS thin film was electrodeposited on the surface of a silicate glass coated with a thin layer of indium tin oxide (ITO). Deposition process was done using potentiostatic mode at room temperature with a potential of 1.05 V for 30, 45, and 60 minutes, followed with annealing the film at 2 different temperatures, 500 ºC using furnace and 180 ºC using hot plate, both treatments for 45 minutes in N2/H2S atmosphere. The X-ray difractograms were analyzed using Match 2 program and showed that the CZTS thin films had kesterit crystalline structure, with a low percentage of CZTS phase. The thin film also contained secondary phases such as Cu2S, ZnS, and SnS. The obtained CZTS thin films had a thickness between 1.039 and 1.676 μm. Absorption study showed that the band gap energy of CZTS thin films which was annealed using furnace ranged from 1.50 to 1.52 eV, whereas that annealed using the hot plate was not observed. The band gap energy value showed that CZTS thin films can be used as sunlight absorber layers on solar cell. The formation of CZTS crystal film on this investigation was effectively performed using furnace annealing process at a temperature of 500 ºC with deposition time of 45 minutes.
Keyword: Thin film, Electrodeposition, Cu2ZnSnS4