Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
by Haizhou Wu; Yongquan Zhou; Qifang Luo
International Journal of Bio-Inspired Computation (IJBIC), Vol. 12, No. 1, 2018

Abstract: We propose a new binary version of hybrid symbiotic organisms search algorithm based on harmony search with greedy strategy for solving 0-1 knapsack problems. A greedy strategy is employed to repair the infeasible solution and optimise the feasible solution. The experiments are carried out in small-scale and large-scale knapsack problem instances. We report on computational experiments which are compared with the results achieved with other state-of-the-art approaches. The results attest the performance of our approach.

Online publication date: Wed, 25-Jul-2018

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