Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms

Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms

Knapsack problem is a combinatorial optimization problem, where a fixed-size Knapsack must be filled with the most valuable items. Solving knapsack problem consider NP hard problem and many previous research tried to find optimal solution for it. In this research, a new hybrid algorithm of Harmony s...

Full description

Bibliographic Details
Main Authors: Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli
Format: Article
Language:English
English
Published: American Scientific Publisher 2018
Subjects:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/19753/
http://umpir.ump.edu.my/id/eprint/19753/1/35.%20Solving%200_1%20Knapsack%20Problem%20Using%20Hybrid%20HS%20and%20Jaya%20Algorithms1.pdf
http://umpir.ump.edu.my/id/eprint/19753/7/Solving%2001%20Knapsack%20Problem%20Using%20Hybrid%20HS%20and%20Jaya%20Algorithms.pdf

Similar Items

Similar Items