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

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,...

Full description

Bibliographic Details
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/ http://umpir.ump.edu.my/id/eprint/25876/ http://umpir.ump.edu.my/id/eprint/25876/1/Solving%2001%20Knapsack%20Problem%20using%20Opposition-based%20Whale.pdf

id	ump-25876
recordtype	eprints
spelling	ump-258762019-10-02T08:01:21Z http://umpir.ump.edu.my/id/eprint/25876/ Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA) Alamri, Hammoudeh S. Zamli, Kamal Z. Ahmad Firdaus, Zainal Abidin Mohd Faizal, Ab Razak QA75 Electronic computers. Computer science QA76 Computer software 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, as many metaheuristic algorithms, Whale Optimization Algorithm (WOA) may fail in local optimum solution. This paper proposes Opposition-based Whale Optimization Algorithm (OWOA) to optimize solution problem in 0/1 Knapsack. The OWOA has been tested original WOA by using twenty cases of Knapsack problem and against other metaheuristic algorithms such as (CGMA) and HS-Jaya. The experimental results indicate a significant performance of the optimization solution and stabilization with minimal standard deviation value. This shows that the OWOA improved the original version WOA and has promising result in comparison with other existing algorithms. Association for Computing Machinery 2019 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/25876/1/Solving%2001%20Knapsack%20Problem%20using%20Opposition-based%20Whale.pdf Alamri, Hammoudeh S. and Zamli, Kamal Z. and Ahmad Firdaus, Zainal Abidin and Mohd Faizal, Ab Razak (2019) Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA). In: ICSCA 2019 Conference Proceedings: 8th International Conference on Software and Computer Applications, 19-21 February 2019 , Penang, Malaysia. pp. 135-139.. ISBN 978-1-4503-6573-4 https://doi.org/10.1145/3316615.3316658
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science QA76 Computer software
spellingShingle	QA75 Electronic computers. Computer science QA76 Computer software Alamri, Hammoudeh S. Zamli, Kamal Z. Ahmad Firdaus, Zainal Abidin Mohd Faizal, Ab Razak Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
description	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, as many metaheuristic algorithms, Whale Optimization Algorithm (WOA) may fail in local optimum solution. This paper proposes Opposition-based Whale Optimization Algorithm (OWOA) to optimize solution problem in 0/1 Knapsack. The OWOA has been tested original WOA by using twenty cases of Knapsack problem and against other metaheuristic algorithms such as (CGMA) and HS-Jaya. The experimental results indicate a significant performance of the optimization solution and stabilization with minimal standard deviation value. This shows that the OWOA improved the original version WOA and has promising result in comparison with other existing algorithms.
format	Conference or Workshop Item
author	Alamri, Hammoudeh S. Zamli, Kamal Z. Ahmad Firdaus, Zainal Abidin Mohd Faizal, Ab Razak
author_facet	Alamri, Hammoudeh S. Zamli, Kamal Z. Ahmad Firdaus, Zainal Abidin Mohd Faizal, Ab Razak
author_sort	Alamri, Hammoudeh S.
title	Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
title_short	Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
title_full	Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
title_fullStr	Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
title_full_unstemmed	Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
title_sort	solving 0/1 knapsack problem using opposition-based whale optimization algorithm (owoa)
publisher	Association for Computing Machinery
publishDate	2019
url	http://umpir.ump.edu.my/id/eprint/25876/ http://umpir.ump.edu.my/id/eprint/25876/ http://umpir.ump.edu.my/id/eprint/25876/1/Solving%2001%20Knapsack%20Problem%20using%20Opposition-based%20Whale.pdf
first_indexed	2023-09-18T22:39:58Z
last_indexed	2023-09-18T22:39:58Z
_version_	1777416849023041536

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

Similar Items