Cover Image

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

Saved in:
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/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
http://umpir.ump.edu.my/id/eprint/19753/
https://doi.org/10.1166/asl.2018.12964
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.ump.umpir.19753
record_format eprints
spelling my.ump.umpir.197532019-03-07T07:44:19Z http://umpir.ump.edu.my/id/eprint/19753/ Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms Alomoush, Alaa A. Alsewari, Abdulrahman A. Alamri, Hammoudeh S. Kamal Z., Zamli QA76 Computer software 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 search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. HS algorithm has been modified to handle the 0/1 Knapsack problem, such as adding penalty function to cope the weight condition, exclude the harmony search bandwidth (bw) parameter, and use the current best result in the next iteration to obtain a better result. The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. The results obtained are competitive to previous HS variants that used to solve Knapsack problem. American Scientific Publisher 2018-11 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/19753/1/35.%20Solving%200_1%20Knapsack%20Problem%20Using%20Hybrid%20HS%20and%20Jaya%20Algorithms1.pdf pdf en http://umpir.ump.edu.my/id/eprint/19753/7/Solving%2001%20Knapsack%20Problem%20Using%20Hybrid%20HS%20and%20Jaya%20Algorithms.pdf Alomoush, Alaa A. and Alsewari, Abdulrahman A. and Alamri, Hammoudeh S. and Kamal Z., Zamli (2018) Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms. Advanced Science Letters, 24 (10). pp. 7486-7489. ISSN 1936-6612 https://doi.org/10.1166/asl.2018.12964 doi: 10.1166/asl.2018.12964
institution Universiti Malaysia Pahang
building UMP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Pahang
content_source UMP Institutional Repository
url_provider http://umpir.ump.edu.my/
language English
English
topic QA76 Computer software
spellingShingle QA76 Computer software
Alomoush, Alaa A.
Alsewari, Abdulrahman A.
Alamri, Hammoudeh S.
Kamal Z., Zamli
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
description 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 search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. HS algorithm has been modified to handle the 0/1 Knapsack problem, such as adding penalty function to cope the weight condition, exclude the harmony search bandwidth (bw) parameter, and use the current best result in the next iteration to obtain a better result. The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. The results obtained are competitive to previous HS variants that used to solve Knapsack problem.
format Article
author Alomoush, Alaa A.
Alsewari, Abdulrahman A.
Alamri, Hammoudeh S.
Kamal Z., Zamli
author_facet Alomoush, Alaa A.
Alsewari, Abdulrahman A.
Alamri, Hammoudeh S.
Kamal Z., Zamli
author_sort Alomoush, Alaa A.
title Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
title_short Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
title_full Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
title_fullStr Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
title_full_unstemmed Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
title_sort solving 0/1 knapsack problem using hybrid hs and jaya algorithms
publisher American Scientific Publisher
publishDate 2018
url 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
http://umpir.ump.edu.my/id/eprint/19753/
https://doi.org/10.1166/asl.2018.12964
_version_ 1643668725953462272
score 13.211869

Similar Items