Judul: Determination of Capacitated Vehicle Routing  Problem Using Ant Colony Optimization and Simulated Annealing
Abstrak: Capacitated Vehicle Routing Problem (CVRP) merupakan variasi dari Vehicle Routing Problem (VRP). CVRP bertujuan mencari rute yang meminimalkan biaya transportasi untuk melayani semua pelanggan dengan tetap memperhatikan kendala kapasitas kendaraan. CVRP bersifat NP-Hard problem sehingga sulit menyelesaikan masalah ini secara langsung. Terdapat beberapa metode metaheuristic yang dapat digunakan untuk menyelesaikan permasalahan ini. Pada karya ilmiah ini, metode metaheuristic yang digunakan untuk menyelesaikan CVRP adalah metode Ant Colony Optimization (ACO) dan metode Simulated Annealing (SA). Penelitian ini menggunakan tujuh kasus CVRP. Hasil penelitian memperlihatkan bahwa waktu eksekusi metode SA relatif lebih cepat untuk kasus dengan jumlah node yang sedikit, tetapi relatif lebih lama untuk jumlah node yang lebih banyak dibandingkan metode ACO. Selain itu, total jarak yang dihasilkan metode SA lebih optimal dibandingkan total jarak yang dihasilkan metode ACO., Capacitated Vehicle Routing Problem (CVRP) is a variation of the Vehicle Routing Problem (VRP). CVRP aims to find routes that minimize transportation costs to serve all customers while taking into account vehicle capacity constraints. CVRP is an NP-Hard problem so it is difficult to solve this problem directly. There are several metaheuristic methods that can be used to solve this problem. In this scientific work, the metaheuristic methods used to solve CVRP are the Ant Colony Optimization (ACO) method and the Simulated Annealing (SA) method. This research uses seven CVRP cases. The results show that the execution time of the SA method is relatively faster for cases with a small number of nodes, but relatively longer for a larger number of nodes than the ACO method. In addition, the total distance generated by the SA method is more optimal than the total distance generated by the ACO method.
Keyword: Ant Colony Optimization, Capacitated Vehicle Routing Problem, metaheuristic, Simulated Annealing

Judul: Penyelesaian Capacitated Vehicle Routing Problem Menggunakan Greedy Randomized Adaptive Search Procedure
Abstrak: Capacitated Vehicle Routing Problem (CVRP) is a variation of Vehicle Routing Problem (VRP), which is intended is the problem to determine the route of vehicle with increasing its capacity. The goal of CVRP is either to minimize the mileage or delivery time of shipping product. In this paper, the CVRP problem will be solved by using a heuristic method, namely Greedy Randomized Adaptive Search Procedure (GRASP).This method has two phases, firstly is determining the initial solution and secondly is improving the quality of the solution. Determination of initial solution was carried out by classifying customers into groups and then designing the routes to minimize distances. Further, the initial solutions are improved by using the 2-opt method. The application of CVRP is showed as an ilustration in determining the minimum distance route of bread product delivery.
Keyword: Bogor Agricultural University (IPB), 2-opt method, VRP, GRASP, heuristic method, CVRP

Judul: Korpus Luteum Persisten pada Sapi serta Beberapa Aspek Penanggulangannya
Abstrak: Korpus luteum pada ovarium terbentuk pada hari ke lima atau ke enam setelah ovulasi terjadi. Bila pada uteru tidak terjadi kebuntingan, korpus luteun dinonaktifkan oleh hormon luteolitik yaitu prostaglandin yang dihasilkan dinding uterus. Jika pada uterus terjadi kebuntingan, korpus luteum tetap bertahan pada ovarium dan berfungsi secara normal, disebut korpus luteum graviditatum. Korpus luteum graviditatum aktif pada sapi betina (erti) selama total waktu 320 hari dalan satu tahun.
Keyword: