A self-adaptive harmony search combined with a stochastic local search for the 0-1 multidimensional knapsack problem
by Abdellah Rezoug; Dalila Boughaci
International Journal of Bio-Inspired Computation (IJBIC), Vol. 8, No. 4, 2016

Abstract: This paper presents a new hybrid self-adaptive harmony search combined with a stochastic local search algorithm (SAHS-SLS) to solve the 0-1 multidimensional knapsack problem (MKP). The proposed SAHS-SLS uses SAHS to create harmonies that will be improved with SLS. We propose a dynamic adjustment of the walk probability (wp) in SLS and a technique to compute the bandwidth (bw) and the pitch adjusting rate (PAR) in SAHS. The overall method SAHS-SLS is implemented and evaluated on benchmarks in order to measure its performance in solving the MKP. It is compared to other approaches to show its effectiveness. The numerical results are encouraging and demonstrate the benefit of the proposed approach.

Online publication date: Tue, 30-Aug-2016

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