TY - JOUR
T1 - Solving 0–1 knapsack problem by binary flower pollination algorithm
AU - Abdel-Basset, Mohamed
AU - El-Shahat, Doaa
AU - El-Henawy, Ibrahim
N1 - Publisher Copyright:
© 2018, The Natural Computing Applications Forum.
PY - 2019/9/1
Y1 - 2019/9/1
N2 - In this paper, we propose a new binary version of the flower pollination algorithm (BFPA) for solving 0–1 knapsack problem. The standard flower pollination algorithm (FPA) is used for the continuous optimization problems. So, a transformation function is used to convert the continuous values generated from FPA into binary ones. A penalty function is added to the evaluation function to give negative values for the infeasible solutions. The infeasible solutions are treated by using a two-stage repair operator called flower repair. Experimental results have proved the superiority of BFPA over other algorithms.
AB - In this paper, we propose a new binary version of the flower pollination algorithm (BFPA) for solving 0–1 knapsack problem. The standard flower pollination algorithm (FPA) is used for the continuous optimization problems. So, a transformation function is used to convert the continuous values generated from FPA into binary ones. A penalty function is added to the evaluation function to give negative values for the infeasible solutions. The infeasible solutions are treated by using a two-stage repair operator called flower repair. Experimental results have proved the superiority of BFPA over other algorithms.
KW - 0–1 knapsack problem
KW - Flower pollination algorithm
KW - Optimization
KW - Penalty function
UR - http://www.scopus.com/inward/record.url?scp=85042604352&partnerID=8YFLogxK
U2 - 10.1007/s00521-018-3375-7
DO - 10.1007/s00521-018-3375-7
M3 - Article
AN - SCOPUS:85042604352
SN - 0941-0643
VL - 31
SP - 5477
EP - 5495
JO - Neural Computing and Applications
JF - Neural Computing and Applications
IS - 9
ER -