Open AccessImproving Flower Pollination Algorithm for Solving 0–1 Knapsack Problem
Author(s) -
Ghalya Tawfeeq Basheer,
Zakariya Yahya Algamal
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1879/2/022097
Subject(s) - knapsack problem , continuous knapsack problem , heuristic , binary number , mathematical optimization , computer science , algorithm , transfer (computing) , mathematics , parallel computing , arithmetic
Binary knapsack problem has received considerable attention in combinational optimization. Various meta-heuristic algorithms are dedicated to solve this problem in the literature. Recently, a binary flower pollination algorithm (BFPA) was proposed, which has been successfully applied to solve 0-1 knapsack problem. In this paper, two new time-varying transfer functions are proposed to improve the exploration and exploitation capability of the BFPA with the best solution and short computing time. Based on small, medium, and high-dimensional scales of the knapsack problem, the computational results reveal that the proposed time-varying transfer functions not only to find the best possible solutions but also to have less computational time. Compared to the standard transfer functions, the efficiency of the proposed time-varying transfer functions is superior, especially in the high-dimensional scales.