Judul: Penyelesaian Stacker Crane Problem dengan Algoritme Largearcs dan Smallarcs
Abstrak: In graph theory, the Rural Postman Problem (RPP) aims to determine the shortest route with minimum cost, in which only certain edges or arcs are necessarily traversed. One type of RPP is Stacker Crane Problem (SCP) which deals with a mixed graph but only arcs are necessarily traversed. SCP can be solved by using two heuristic algorithms, i.e. Largearcs and Smallarcs algorithms, which include other algorithms in their steps, such as: Dijkstra algorithm to determine shortest route, Hungaria method to determine minimum bipartite matching, Prim algorithm to determine minimum spanning tree, and van Aardenne-Ehrenfest & de-Bruijn algorithm and Fleury algorithm to determine Euler circuits. The shortest Euler circuit resulted from two heuristic algorithms can be used to find a solution of SCP. The application of SCP is illustrated in establishing the minimum distance route of catering delivery.
Keyword: 

Judul: Penyelesaian Directed Rural Postman Problem
Abstrak: Rural Postman Problem (RPP) merupakan masalah penentuan rute optimal dengan syarat ada rute-rute tertentu yang harus dilewati, sedangkan rute lainnya boleh dilewati. Jika suatu rute dilewati, maka haruslah dilewati tepat satu kali. Dalam karya ilmiah ini akan dibahas penyelesaian RPP pada graf berarah atau Directed Rural Postman Problem (DRPP) dengan menggunakan dua algoritme heuristik, yaitu algoritme Balance & Connect (B&C) dan algoritme Connect & Balance (C&B). Formulasi masalah transportasi digunakan untuk mengubah graf takbalans menjadi graf balans. Penentuan path terpendek diselesaikan dengan menggunakan algoritme Dijkstra, dan penentuan minimum spanning tree diselesaiakan dengan menggunakan Algoritme Prim. Solusi DRPP dengan menggunakan algoritme B&C dan algoritme C&B berupa sirkuit Euler yang bisa ditentukan dengan menggunakan algoritme van Aardenne−Ehrenfest & de Bruijn. Contoh aplikasi yang digunakan dalam karya ilmiah ini adalah penentuan rute optimal antar-jemput padi gilingan
Keyword: Graph algorithm, Branch and bound, Minimum spanning tree, Bogor Agricultural University, Institut Pertanian Bogor, IPB

Judul: Daya Tahan IgY Spesifik Terhadap Influenza dan COVID-19 dalam Balsam Bibir
Abstrak: Influenza and SARS-CoV-2 virus are respiratory infections and require antiviral medications due to severe consequences. Utilization of specific immunoglobulin Y (IgY) inserted in personal care products were developed. The aim of this study was to evaluate durability of specific IgY against influenza and COVID-19 in lipbalm. The concentration of IgY used in this research was 0.1% and 0.25%. Three groups were observed: control (C) lipbalm without IgY, treatment 1 (T1) lipbalm with 0.1% IgY and treatment 2 (T2) lipbalm with 0.25% IgY. Organoleptic tests were conducted and recorded which includes the sense of smell, colour and consistency for six weeks. The presence of IgY in lipbalm was evaluated using enzyme-linked-immunosorbent-assay (ELISA) and neutralizationassay. There were some noticeable changes of organoleptic that can be observed such as colour darkened and texture hardened of the lipbalm. Most of the assays gave negative results in T1 and T2, whilst only few of them were doubtful. Our result indicated that IgY concentration of 0.1% or 0.25% in lipbalm were not optimal. However, the negative result might be due to the unavailability of IgY in the product to be dissolved in deionized water since we used beeswax as lipbalm component.
Keyword: Covid-19, egg yolk immunoglobulin Y, lipbalm, influenza