Judul: Optimisasi Rute Traveling Salesman Problem Menggunakan Algoritme Bee Colony Optimization
Abstrak: Traveling Salesman Problem (TSP) merupakan masalah penentuan rute guna mengunjungi sekumpulan kota/tempat yang sepenuhnya terhubung dimana setiap koneksi antar dua kota dikaitkan dengan jarak atau biaya. Ada beberapa metode yang digunakan untuk penyelesaian masalah ini. Pada karya ilmiah ini, digunakan metode eksak Integer Linear Programming (ILP) dan metode meta-heuristic Bee Colony Optimization (BCO) untuk menyelesaikan TSP. Metode eksak ILP diselesaikan dengan bantuan perangkat lunak optimisasi LINGO 18.0, sedangkan metode BCO diselesaikan dengan bantuan bahasa pemrograman Python 3.6.9. Hasil yang diperoleh menunjukan bahwa waktu eksekusi metode BCO lebih cepat dibandingkan metode eksak namun, metode BCO menghasilkan selisih jarak yang relatif besar dibandingkan metode eksak., Traveling salesman problem (TSP) is a problem of determining a route to visit a group of fully connected cities/places where each connection between two cities is related to distance or cost. There are several methods to solve this problem. In this manuscript, integer linear programming (ILP) as an exact method and bee colony optimization (BCO) as a meta-heuristic method will be used to solve TSP. The exact ILP method is solved by LINGO 18.0 optimization software, while the BCO method is solved by Python 3.6.9 programming language. The results obtained show that the BCO execution time is faster than the exact method, but the BCO method produces a relatively large distance difference compared to the exact method.
Keyword: bee colony optimization, integer linear programming, meta-heuristic method, traveling salesman problem

Judul: Optimisasi Rute Travelling Salesman Problem Menggunakan Firefly Algorithm
Abstrak: Travelling Salesman Problem (TSP) merupakan masalah penentuan rute guna mengunjungi sekumpulan kota/tempat yang sepenuhnya terhubung di mana setiap koneksi antarkota dikaitkan dengan jarak atau biaya. Karya ilmiah ini bermaksud untuk menyelesaikan TSP dengan menggunakan metode Firefly Algorithm (FA), serta membandingkan hasilnya dengan menggunakan algoritme lainnya, yakni Ant Colony Optimization, Bee Colony Optimization, dan Simulated Annealing. Keempat algoritme tersebut selanjutnya dibandingkan dengan metode eksak Integer Linear Programming (ILP) sebagai metode acuan yang menghasilkan solusi yang optimal. Hasil yang diperoleh dari tiga kasus yang dibangkitkan menunjukan bahwa hasil total jarak yang dihasilkan metode FA lebih baik dibandingkan dengan ketiga metode lainnya., Travelling Salesman Problem (TSP) is a route determination problem to visit a set of fully connected cities/places where each connection between two cities is associated with distance or cost. This scientific work intends to solve TSP using the Firefly Algorithm (FA) method, and compare the results using other algorithms, namely Ant Colony Optimization, Bee Colony Optimization, and Simulated Annealing. The four algorithms are then compared with the exact Integer Linear Programming (ILP) method as a reference method that produces an optimal solution. The results obtained from the three raised cases show that the total distance obtained by the FA method is better than the other three methods.
Keyword: ant colony optimization, bee colony optimization, firefly algorithm, simulated annealing, travelling salesman problem

Judul: Characterizations of low alloy steel sae 4422  plated with chromic acid (Cro3)
Abstrak: Characterizations of low alloy steel SAE 4422 plated with chromic acid (CrOrO3) was use Optical Microscopy (OM), Scanning Electron Microscopy (SEM), X-Ray Diffraction (XRD), RD),Energy Dispersive Analysis of X-Ray (EDAX), Hardness Test and Roughness Test. Microstructures analysis exhibits cracks and grain boundaries microcracks as a characteristics of chrome metal found at plating metal. Perlite and Ferrite as grains of steel found at base metal with grain boundaries around it. Phase analysis of plating metal appropriate to chrome metal with lattice constant (a) is 2.559 Å and phase analysis of base metal appropriate to iron ferrite with lattice constant (a) is 3.318 Å. Both plating and base metal have cubic system. Chemical analysis of plating metal at surface section exhibits that cracks area have highest value of carbon element compare with grains and grains boundaries area. While chemical analysis of base metal at cross section exhibits that perlite have highest value of carbon element compare with ferrite and grain boundaries. The hardness value of plating metal at surface section and cross section are 753 and 637 VHN. While, the hardness value of base metal and interface area at cross section are 205 and 373 VHN. The roughness value at measurement points of chrome surface for as received sample are 0.445 μm. Observation used Optical Microscopy and Scanning Electron Microscopy exhibits surface irregularities combine to form surface texture of plating metal at surface section.
Keyword: