Akademik Veri Yönetim Sistemi
V. INTERNATIONAL APPLIED STATISTICS CONGRESS (UYIK - 2024), İstanbul, Türkiye, 21 Nisan - 23 Mayıs 2024, ss.73
The Chernobyl Disaster
Optimizer (CDO) has recently been introduced metaheuristic algorithm inspired
by the explosion in the 4th reactor of the Chernobyl nuclear power plant in
1986. Although the original CDO demonstrates excellent performance in solving
continuous problems, it cannot be applied directly to the binary problems such
as the 0-1 knapsack problem. The 0-1 Knapsack problem (0-1 KP) is one of the
well-known NP-hard combinatorial optimization problem that is a challenging
problem to solve efficiently using conventional techniques. The objective of
this problem is to identify the optimal subset of items from a given set, with
its own specific profit and weight, that maximizes profit while remaining
within the capacity of the knapsack. Different methods have been proposed to
solve the 0-1 knapsack problem. In this paper, the binary CDO algorithm is
proposed to solve the 0-1 Knapsack problems and called as BCDO. Original CDO is
adapted to 0-1 KP using S shaped transfer function. Several experiments were
performed to compare the performance of the BCDO to several competing
optimizers when solving 25 benchmark knapsack instances with different
dimensions. The experimental results show the superiority of the proposed
binary CDO algorithm.