Loading...
Please wait, while we are loading the content...
Similar Documents
Improving Flower Pollination Algorithm for Solving 0–1 Knapsack Problem
| Content Provider | Scilit |
|---|---|
| Author | Basheer, Ghalya Tawfeeq Algamal, Zakariya Yahya |
| Copyright Year | 2021 |
| Description | Journal: Journal of Physics: Conference Series 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. |
| Related Links | https://iopscience.iop.org/article/10.1088/1742-6596/1879/2/022097/pdf |
| ISSN | 17426588 |
| e-ISSN | 17426596 |
| DOI | 10.1088/1742-6596/1879/2/022097 |
| Journal | Journal of Physics: Conference Series |
| Issue Number | 2 |
| Volume Number | 1879 |
| Language | English |
| Publisher | IOP Publishing |
| Publisher Date | 2021-05-01 |
| Access Restriction | Open |
| Subject Keyword | Journal: Journal of Physics: Conference Series Hardware and Architecture Problem Binary Knapsack |
| Content Type | Text |
| Resource Type | Article |
| Subject | Physics and Astronomy |
