Judul: Genetic Algorithm on Solving Travelling Salesman Problems for Distribution of Organic Porridge Products
Abstrak: Pada penelitian ini, dibahas pencarian rute terpendek untuk mendistribusikan produk bubur organik yang diproduksi oleh PT. Rofindiya Ekamulia Sukses ke sejumlah outlet, yang mana setiap outlet hanya dapat dikunjungi satu kali saja dan proses distribusi dimulai dan diakhiri dari suatu outlet yang sama. Terdapat 44 outlet yang pada awalnya terbagi ke dalam 9 jalur distribusi, yang kemudian penulis usulkan dikelompokkan menjadi 3 jalur distribusi saja untuk efisiensi perusahaan. Permasalahan pendistribusian produk tersebut pada masing-masing jalur distribusi dapat dikategorikan sebagai travelling salesman problems (TSP). Pencarian rute terpendek pada masing-masing jalur distribusi dilakukan dengan menggunakan algoritme genetika (GA). Dalam implementasi GA, barisan outlet pada suatu jalur distribusi direpresentasikan sebagai barisan gen pada suatu kromosom. Nilai fitness pada GA dalam hal ini diasosiasikan sebagai total jarak tempuh suatu rute, sehingga implementasi GA dalam penelitian ini diarahkan untuk memperoleh nilai fitness yang terkecil. Hasil implementasi GA menunjukkan adanya perbaikan total jarak tempuh bila jumlah iterasi dan ukuran populasi ditingkatkan. Implementasi GA dilakukan dengan menggunakan bahasa pemrograman Octave., This study discussed finding a shortest route to distribute the organic porridge products produced by PT. Rofindiya Ekamulia Sukses to some outlets, in which each outlet is visited exactly once and the distribution process is started and ended from the same outlet. There are 44 outlets involved in this study. The outlets are initially grouped into 9 distribution tracks. The authors proposed to regroup them into 3 distribution tracks to increase distribution efficiency. The distribution problem on each track can be categorized as a travelling salesman problems (TSP). Each of those 3 distribution problems is solved using genetic algorithm (GA). In the implementation of GA, the outlet sequence on a distribution route is represented as a gene sequence on a chromosome. Since the fitness value of a chromosome is associated with total travelling distance of that route, the implementation of GA in this study is directed to obtain a smallest fitness value. The GA implementation shows that the total travelling distance can be reduced, up to a certain level, by increasing the number of iterations and the population size. The GA implementation is done using the programming language Octave.
Keyword: GA, route, total distance, TSP

Judul: Penyelesaian Vehicle Routing Problem pada Pendistribusian Sayuran Dataran Tinggi Menggunakan Algoritme Genetika (Studi Kasus PT Saung Mirwan)
Abstrak: Vehicle routing problem (VRP) is an important issue on a transportation system that aims at minimizing the total vehicle mileage to reduce vehicle operating cost to a minimum. Vehicle routing problem belongs to the class of non-polynomial hard (NP-hard), which generally uses a heuristic approach to find a solution. In this time, Vehicle routing problem resolution will be applied to the distribution of highland vegetables from PT. Saung Mirwan as the vegetable distribution center. The problems that often arise in the distribution of highland plain vegetables is to how minimize the total of transportation costs without sacrificing the goal completion time to reduce the risk of the decline in the quality of vegetables during the trip. Issues will become increasingly complex if the vehicle routing problem is flexible to changes that occur in the limit or the value of decision variables. The problems encountered in this case include heterogeneous multi fleet VRP, single source, single trip, and multi-product. Therefore, this research used genetic algorithm optimization method (GA) to solve the problem. Genetic algorithm is one of the heuristic methods, which is analogous to the process of evolution by natural selection phase, crossover and mutation. In this paper a simulation is performed by searching the optimum solution to the location of the distribution as the destination points. Optimum solutions are obtained in the form of division of highland vegetable distribution channels that meet the existing constraints. As a solution, there was reduction of the distribution time of about 1 hour 58 minutes or an increase in time efficiency by approximately 32.22% and a reduction of the fleet utilization by 1 fleet or an increase of fleet efficiency by 14.28%.
Keyword: 

Judul: Karakteristik Anatomi Skelet Kepala Buaya senyulong (Tomistoma schlegelii).
Abstrak: Buaya sepit atau senyulong (Tomistoma schlegelii) merupakan jenis buaya asli Indonesia yang berhabitat di sungai-sungai Sumatera, Kalimantan, dan juga pedalaman Sulawesi. Salah satu ciri khas buaya senyulong adalah bentuk moncong yang runcing dan sempit, namun hingga saat ini informasi mengenai struktur skelet kepala buaya senyulong sangat terbatas. Penelitian ini bertujuan untuk mempelajari karakteristik anatomi skelet kepala buaya senyulong yang dikatikan dengan fungsi dan perilakunya. Penelitian dilakukan secara eksploratif dengan melakukan pengamatan, pencatatan, dan pengambilan gambar dari skelet kepala buaya senyulong. Skelet kepala berukuran panjang 70 cm, lebar 29 cm, dan tingggi 17 cm dengan permukaan kasar pada os nasale, os frontale, os maxilla, os mandibula, os lacrimale, os jugale. Jumlah gigi pada buaya ini sebanyak 78 buah, terdiri dari 4 buah gigi premaxila, 16 buah gigi maxila, dan 19 buah gigi mandibula. Pada regio orbitalis ditemukan dua pasang fenestrae temporales yang berkembang baik. Fenestra supratemporale merupakan lubang oval yang membentang di sepanjang os parietale. Fenestra infratemporale berbentuk segitiga dan dibatasi oleh os squamosum, os postorbitale, os jugulare, dan os quadratum. Os mandibula hewan ini mempunyai symphysis mandibularis yang panjang yaitu garis yang melintang di corpus mandibulae. Secara fungsional ukuran symphysis mandibularis berkaitan dengan adaptasi hewan terhadap diet makan.
Keyword: kepala, moncong, Tomistoma schlegelii