A discrete binary version of bat algorithm for multidimensional knapsack problem
by Sara Sabba; Salim Chikhi
International Journal of Bio-Inspired Computation (IJBIC), Vol. 6, No. 2, 2014

Abstract: The nature has become a main inspiration source of scientists for developing new intelligent systems and techniques. Nature-inspired meta-heuristics is a kind of algorithms that imitate the social behaviour of some biological species. The bat algorithm (BA) is a new bio-inspired algorithm recently introduced by Yang (2010a). It is an optimisation method that is based on the echolocation behaviour of microbats. Firstly, the BA has been proposed for continuous problems. In this paper, we propose a discrete binary bat algorithm (BinBA) for solving the optimisation problems in binary space. The proposed algorithm is based on the sigmoid function used by Kennedy and Eberhart in 1997 for their binary particle swarm optimisation algorithm. The BinBA was tested on hard instances of the multidimensional knapsack problem. The obtained results are very promising compared to other bio-inspired algorithms.

Online publication date: Sat, 27-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com