Nature-inspired optimization algorithms in knapsack problem: A review

Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem. In this paper, four meta-heuristic algorithms are presented particle swarm optimizat...

Full description

Bibliographic Details
Main Authors: Ghalya Tawfeeq Basheer, Zakariya Algamal
Format: Article
Language:Arabic
Published: College of Computer Science and Mathematics, University of Mosul 2019-12-01
Series:المجلة العراقية للعلوم الاحصائية
Subjects:
Online Access:https://stats.mosuljournals.com/article_164174_93c0ad187efbb4864d16131a51e77e88.pdf
_version_ 1811242076828860416
author Ghalya Tawfeeq Basheer
Zakariya Algamal
author_facet Ghalya Tawfeeq Basheer
Zakariya Algamal
author_sort Ghalya Tawfeeq Basheer
collection DOAJ
description Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem. In this paper, four meta-heuristic algorithms are presented particle swarm optimization, firefly algorithm, flower pollination algorithm and monarch butterfly optimization in solving knapsack problem as example of NP-hard combinational optimization problems. Based on twenty 0-1 knapsack problem instances, the computational results demonstrated that the binary flower pollination algorithm has the ability to find the best solutions in reasonable time.<br /> <strong> </strong>
first_indexed 2024-04-12T13:46:44Z
format Article
id doaj.art-688404ae19974ec4bbd75e6480e5dc99
institution Directory Open Access Journal
issn 1680-855X
2664-2956
language Arabic
last_indexed 2024-04-12T13:46:44Z
publishDate 2019-12-01
publisher College of Computer Science and Mathematics, University of Mosul
record_format Article
series المجلة العراقية للعلوم الاحصائية
spelling doaj.art-688404ae19974ec4bbd75e6480e5dc992022-12-22T03:30:40ZaraCollege of Computer Science and Mathematics, University of Mosulالمجلة العراقية للعلوم الاحصائية1680-855X2664-29562019-12-01163557210.33899/iqjoss.2019.164174164174Nature-inspired optimization algorithms in knapsack problem: A reviewGhalya Tawfeeq Basheer0Zakariya Algamal1Department of operations research and intelligent techniques, University of Mosul, Mosul, Iraq.Dept. of Statistics and Informatics/ college of computer sciences and mathematics/ University of Mosul, Mosul, iraqMeta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem. In this paper, four meta-heuristic algorithms are presented particle swarm optimization, firefly algorithm, flower pollination algorithm and monarch butterfly optimization in solving knapsack problem as example of NP-hard combinational optimization problems. Based on twenty 0-1 knapsack problem instances, the computational results demonstrated that the binary flower pollination algorithm has the ability to find the best solutions in reasonable time.<br /> <strong> </strong>https://stats.mosuljournals.com/article_164174_93c0ad187efbb4864d16131a51e77e88.pdfcombinatorial optimization problemnp-hard problem0-1 knapsack problemmeta-heuristic algorithms
spellingShingle Ghalya Tawfeeq Basheer
Zakariya Algamal
Nature-inspired optimization algorithms in knapsack problem: A review
المجلة العراقية للعلوم الاحصائية
combinatorial optimization problem
np-hard problem
0-1 knapsack problem
meta-heuristic algorithms
title Nature-inspired optimization algorithms in knapsack problem: A review
title_full Nature-inspired optimization algorithms in knapsack problem: A review
title_fullStr Nature-inspired optimization algorithms in knapsack problem: A review
title_full_unstemmed Nature-inspired optimization algorithms in knapsack problem: A review
title_short Nature-inspired optimization algorithms in knapsack problem: A review
title_sort nature inspired optimization algorithms in knapsack problem a review
topic combinatorial optimization problem
np-hard problem
0-1 knapsack problem
meta-heuristic algorithms
url https://stats.mosuljournals.com/article_164174_93c0ad187efbb4864d16131a51e77e88.pdf
work_keys_str_mv AT ghalyatawfeeqbasheer natureinspiredoptimizationalgorithmsinknapsackproblemareview
AT zakariyaalgamal natureinspiredoptimizationalgorithmsinknapsackproblemareview