Nature-inspired optimization algorithms in knapsack problem: A review

Abstract

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. Keywords: Combinatorial optimization problem; NP-hard problem; 0-1 knapsack problem; Meta-heuristic algorithms. ‫مقال‬ ‫مراجعت‬ :‫الظهر‬ ‫حقيبت‬ ‫مسألت‬ ‫لحل‬ ‫الطبيعت‬ ‫من‬ ‫المستوحاة‬ ‫مثليت‬ َ ‫األ‬ ‫خوارزمياث‬ :‫الملخص‬ .‫ة‬ ‫االخير‬ ‫ات‬ ‫السنو‬ ‫في‬ ‫لمبحث‬ ٌ ‫اسع‬ ‫و‬ ٌ ‫مجال‬ ‫لها‬ ‫الطبيعة‬ ‫من‬ ‫المستوحاة‬ ‫ارزميات‬ ‫الخو‬ ‫أصبحت‬ ‫حقيبة‬ ‫مسألة‬ ‫خاصة‬ ‫افقية‬ ‫التو‬ ‫االمثمية‬ ‫مسائل‬ ‫حل‬ ‫في‬ ‫كفاءتها‬ ‫اثبتت‬ ‫ارزميات‬ ‫الخو‬ ‫هذه‬ ‫وبعض‬ : ‫هي‬ ‫ارزميات‬ ‫خو‬ ‫بع‬ ‫أر‬ ‫مفاهيم‬ ‫استعرضنا‬ ‫البحث‬ ‫هذا‬ ‫وفي‬ ‫الظهر‬ particle swarm optimization, firefly algorithm, flower pollination algorithm and monarch butterfly optimization. ‫الصعبة‬ ‫افقية‬ ‫التو‬ ‫األمثمية‬ ‫مسائل‬ ‫عمى‬ ‫كمثال‬ ‫الظهر‬ ‫حقيبة‬ ‫مسألة‬ ‫لحل‬ NP-hard problem. ‫الى‬ ‫وباالستناد‬ 20 ‫ان‬ ‫الحسابية‬ ‫النتائج‬ ‫أظهرت‬ ‫مختلفة‬ ‫وبأحجام‬ ‫الظهر‬ ‫حقيبة‬ ‫مسألة‬ ‫من‬ ‫حالة‬ ‫خىارزمية‬ binary flower pollination algorithm ‫في‬ ‫الحمول‬ ‫أفضل‬ ‫إيجاد‬ ‫عمى‬ ‫ة‬ ‫القدر‬ ‫لديها‬ .‫األخرى‬ ‫المستخدمة‬ ‫ارزميات‬ ‫بالخو‬ ‫نة‬ ‫مقار‬ ‫معقول‬ ‫وقت‬