Judul: Penyelesaian Vehicle Routing Problem  with Simultaneous Delivery and Pickup: Studi Kasus Pendistribusian LPG 3 kg
Abstrak: Permasalahan rute pendistribusian termasuk dalam vehicle routing problem (VRP). VRP memiliki beberapa variasi, salah satunya adalah vehicle routing problem with simultaneous delivery and pickup (VRPSDP). Pengaplikasian VRPSDP dapat dilihat dari pendistribusian tabung LPG 3 kg, di mana agen mengirim tabung terisi ke pangkalan dan mengambil tabung kosong dalam satu kali perjalanan. VRPSDP dapat diselesaikan menggunakan metode eksak dan heuristik. Pada penelitian ini, dijelaskan bagaimana algoritme genetika mampu menyelesaikan masalah perutean kendaraan untuk mendistribusikan tabung LPG 3 kg pada PT Anten Surya Saputra. Algoritme genetika merupakan salah satu metode heuristik yang mendekati solusi optimal melalui beberapa proses, di antaranya seleksi, kawin silang, dan mutasi. Hasilnya, algoritme genetika mampu memberikan solusi yang mendekati optimal dalam waktu yang relatif lebih singkat dibanding metode eksak, dengan rata-rata persentase selisih solusinya adalah 6.32%., Distribution route problems are included in the vehicle routing problem (VRP). VRP has several variations, one of them is the vehicle routing problem with simultaneous delivery and pickup (VRPSDP). The application of VRPSDP can be seen from the distribution of 3 kg LPG, where the agent sends filled tubes to the base and pick up empty tubes in one trip. VRPSDP can be solved using exact and heuristic methods. In this study, it is explained how the genetic algorithm is able to solve the problem of vehicle routing to distribute 3 kg LPG at PT Anten Surya Saputra. Genetic algorithm is a heuristic method that approaches the optimal solution through several processes, including selection, crossover, and mutation. As a result, genetic algorithms are able to provide sub-optimal solutions in a relatively shorter time than the exact method, with an average percentage of the difference in solutions is 6.32%.
Keyword: 3 kg LPG, distribution, genetic algorithm, vehicle routing problem, VRPSDP

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