Viral Systems Application for Knapsack Problem

Knapsack problem is a problem that arises when determining what items should be included in a storage area, which has a maximum storage capacity. A metaheuristic algorithm, Viral Systems, is applied to overcome the weaknesses of optimization methods. There are 3 hypothetical cases, which the basic difference is the number of items involved. The cases are used for parameter testing. Based on the experimental results, no Viral Systems parameters influence the objective function value in Case 1. The interaction between LIT
⁰
, p
_r
, and p
_lt
influences the objective function value in Case 2. LNR
⁰
, p
_lt
, the interaction between p
_r
and p
_lt
, and the interaction between LIT
⁰
, LNR
⁰
, and pi influence the objective function value in Case 3. This research shows that Viral Systems is found to be promising, since it successfully reaches optimal solution for the first two cases. Nevertheless, parameters selection should be investigated more thoroughly.