Judul: The Application of Genetic Algorithm in Vehicle Routing Problem and Its Implementation on Rastra Distribution
Abstrak: Rute pendistribusian kendaraan terkait proses distribusi produk merupakan masalah yang dihadapi produsen dalam memenuhi kebutuhan konsumen. Penentuan rute distribusi kendaraan atau vehicle routing problem (VRP) bertujuan menentukan rute dan penggunaan kendaraan agar biaya yang dikeluarkan minimal. Pada penelitian ini akan dibahas rute pendistribusian kendaraan untuk mengantarkan beras sejahtera dari beberapa gudang penyimpanan ke desa/kelurahan tertentu yang dimiliki Perum Bulog kabupaten Ponorogo untuk satu dari dua belas periode. Salah satu desa/kelurahan memiliki permintaan yang melebihi kapasitas kendaraan, sehingga lokasi tersebut dapat dikunjungi kendaraan dengan pendistribusian terpisah. VRP dapat diselesaikan menggunakan metode eksak dan metode heuristik. Metode heuristik genetic algorithm dengan pencarian solusi awal melalui nearest neighbour diterapkan untuk masalah pendistribusian beras pada periode di Perum Bulog. Solusi yang dihasilkan oleh metode heuristik memiliki waktu yang lebih cepat dibandingkan solusi metode eksak., The vehicle distribution route related to the product distribution process is a problem faced by manufacturers in meeting consumer needs. Determination of vehicle distribution routes or vehicle routing problem (VRP) aims to determine the route and use of vehicles so that the costs incurred are minimal. In this study the route of distribution of vehicles to deliver prosperous rice from several storage warehouses to certain villages will be discussed, which is owned by Perum Bulog in Ponorogo Regency for one of the twelve periods. One of the village has a demand that exceeds the vehicle capacity, so that the location can be visited by vehicles with split delivery. VRP can be solved using exact methods and heuristic methods. The heuristic genetic algorithm method by searching for an initial solution through the nearest neighbour is applied to the problem of distributing rice during the period at Perum Bulog. The solution produced by the heuristic methods has a faster time than the solution of the exact methods.
Keyword: distribution, heuristic method, multidepot, split delivery, vehicle routing problem

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