NobleBlocks

Research indexJournal article

New binary bat algorithm for solving 0–1 knapsack problem

Rizk‐Allah, Hassanien

Complex & Intelligent Systems5 Aug 2017Open access

NobleIDark:/48914/w1/20260524/1DAB05C9DOI10.1007/s40747-017-0050-z

Abstract

This paper presents a novel binary bat algorithm (NBBA) to solve 0–1 knapsack problems. The proposed algorithm combines two important phases: binary bat algorithm (BBA) and local search scheme (LSS). The bat algorithm enables the bats to enhance the exploration capability while LSS aims to boost the exploitation tendencies and, therefore, it can prevent the BBA–LSS from the entrapment in the local optima. Moreover, the LSS starts its search from BBA found so far. By this methodology, the BBA–LSS enhances the diversity of bats and improves the convergence performance. The proposed algorithm is tested on different size instances from the literature. Computational experiments show that the BBA–LSS can be promise alternative for solving large-scale 0–1 knapsack problems.

Discussion

Citations

Topics

More

Suggest a correction or report