Hybrid binary wolf pack algorithm for the 0-1 multidimensional knapsack problem
by Hao Li; Peng Bai; Hu-Sheng Wu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 12, No. 3, 2017

Abstract: Wolf Pack Algorithm (WPA) has been successfully applied in unconstrained global optimisation problems. In order to effectively solve the multi-constrained combinatorial optimisation problem such as Multidimensional Knapsack Problem (MKP), a hybrid repair operator based on its specific knowledge is designed to repair and improve the infeasible solutions. Moreover, inspired by the reproductive modes of wolf pack, with the help of binary code, a Hybrid Binary Wolf Pack Algorithm (HBWPA) is proposed. Then HBWPA was tested on problems from the OR-Library to validate and demonstrate the efficiency of the proposed algorithm. The results were compared with those obtained by other two start-of-the-art existing algorithms, modified binary particle swarm optimisation and chaotic binary swarm optimisation with time-varying acceleration coefficients. Experimental results show that the proposed algorithm not only found comparable solutions for the standard MKP of different size, but also has good computational robustness.

Online publication date: Tue, 27-Jun-2017

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 Wireless and Mobile Computing (IJWMC):
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