Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)

• Main Authors: Alamri, Hammoudeh S., Zamli, Kamal Z., Ahmad Firdaus, Zainal Abidin, Mohd Faizal, Ab Razak
• Format: Conference or Workshop Item
• Language: English
• Published: Association for Computing Machinery 2019
• Subjects: QA75 Electronic computers. Computer science; QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/25876/1/Solving%2001%20Knapsack%20Problem%20using%20Opposition-based%20Whale.pdf; http://umpir.ump.edu.my/id/eprint/25876/; https://doi.org/10.1145/3316615.3316658

The 0/1 Knapsack problem is one of the most popular real-world optimization problems that arise in searching space and finding the most optimum solution. Theoretically, the optimum solution problem of the 0/1 Knapsack requires suitable technique to explore the search space effectively. Practically,...