PENERAPAN ALGORITMA ELEPHANT HERDING OPTIMIZATION PADA PERMASALAHAN KNAPSACK 0-1
Daftar Isi:
- Knapsack problem is the problem of choosing from many stored objects so that an optimal storage is obtained by paying attention to objects that consist of n objects (1, 2, 3, ...) where each object has a weight (Wi) and profit (Pi) by considering also the storage media capacity of M. There are many methods for solving knapsack problems, one of which uses the metaheuristic method. Metaheuristic methods that have been used to solve knapsack 0-1 problems include Binary Firefly Algorithm (BFA), and Genetic algorithms. This study uses the Elephant Herding Optimization (EHO) algorithm to solve knapsack 0-1 problems. The results of this study were compared with BFA with a higher accuracy of 6 problems. The profit value in the EHO algorithm is higher if more and more iterations are done.