Judul: Solving a Capacitated Arc Routing Problem Using Path Scanning Heuristic with Efficiency Rule
Abstrak: Capacitated Arc Routing Problem (CARP) merupakan salah satu bentuk permasalahan penentuan rute transportasi yang melibatkan graf dengan sisi tak berarah. Tujuan dari graf CARP adalah melayani semua permintaan pelanggan yang berada pada sisi graf dengan sejumlah kendaraan berkapasitas homogen yang memulai dan mengakhiri perjalanannya di sebuah depot. Salah satu metode heuristik yang dapat digunakan untuk menentukan solusi terbaik graf CARP adalah algoritme path scanning. Metode ini mengarahkan kendaraan yang sedang beroperasi agar melayani sisi terdekat yang belum dilayani sampai sisa kapasitas kendaraan tidak mencukupi untuk melayani sisi berikutnya. Dalam perkembangannya, algoritme path scanning dimodifikasi dengan menambahkan kriteria pembangkit aturan (triggering criteria) dan aturan efisiensi. Penambahan komponen tersebut bertujuan membatasi pemilihan sisi yang belum dilayani ketika sisa kapasitas kendaraan mencapai batas tertentu sehingga solusi dapat lebih optimal. Hasilnya menunjukkan bahwa penggunaan algoritme path scanning dengan aturan efisiensi lebih baik daripada algoritme path scanning perdana. Kata kunci: aturan efisiensi, CARP, graf, metode heuristik, path scanning, Capacitated Arc Routing Problem (CARP) is one of the transportation problems which involves a graph with undirected arcs. The objective of CARP is to service all of the customers’ demands located on the edges of the graph with a fleet of homogenous vehicles with limited capacity that starts and ends its routes at a depot. One of the heuristic methods that can be used to gain the best solution of the CARP is the path scanning algorithm. This method let the current operating vehicle to service the nearest unserviced edge until the remaining vehicle capacity is not sufficient enough to service the next unserviced edge. Several years later, the path scanning algorithm has been modified by adding a triggering criteria and an efficiency rule. The aim of these additional components is to restrict the next unserviced edge to be serviced by the vehicle when the remaining vehicle capacity has reached a certain load threshold, so that the solution could be more optimal. The result shows that the path scanning algorithm with efficiency rule has a better performance than the first path scanning algorithm. Keywords: CARP, efficiency rule, graph, heuristic method, path scanning
Keyword: CARP, efficiency rule, graph, heuristic method, path scanning

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: Durability of Specific Immunoglobulin (Ig) Y Againts Influenza and Covid-19 in Sunscreen
Abstrak: The benefit of specific immunoglobulin Y (Ig Y) as an active ingredient in personal care products such as sunscreen has not been properly studied. Our study aims to evaluate the reliability of specific IgY against influenza and the COVID-19 virus in a sample sunscreen product. Specific IgY influenza and COVID-19 viruses were inserted in the sample sunscreen at two concentrations of 0.1% and 0.25%. Three treatments were observed: control (C) sunscreen without IgY, treatment 1 (T1) sunscreen with 0.1% IgY, and treatment 2 (T2) sunscreen with 0.25% IgY. Organoleptic observations were carried out to monitor changes in aroma, color, and texture, and sunscreen sampling was done every week for 6 weeks. The durability of IgY was evaluated using an enzyme-linked immunosorbent assay (ELISA) and a neutralization assay. Organoleptic observation from weeks 1 to 6 showed consistency in its aroma, color, and texture. Enzyme-linked immunosorbent assay and neutralization assay (NA) results of the T1 and T2 groups showed negative results except for sample T1 at week 5, which showed a positive result in the Influenza A ELISA. Based on the results, it seems that IgY concentrations of 0.1% or 0.25% were not optimal. However, this negative result might be due to low concentration of the IgY and the presence of beeswax, which inhibits IgY and causes it to dissolve in distilled water, thus preventing it from being detected in the assay.
Keyword: Immunoglobulin Y, Sunscreen, Influenza, COVID-19, Biological Activity