Solving knapsack problems using heart algorithm
by Abdolreza Hatamlou; Elham Ghaniyarlou
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 5, No. 4, 2016

Abstract: One of the most novel optimisation methods is the heart optimisation algorithm. The basic idea of the heart algorithm is inspired by the heart and blood circulatory system in the human bodies. This algorithm starts with a randomly initial population of candidate solutions and objective function which is computed for them. The best candidate solution is selected as heart and the others form blood molecules. Then the heart enforces other candidates to move toward/away from the heart and search for the optimal solution. In this paper, the Heart algorithm for the first time is applied to solve knapsack problems. The experimental results on the several benchmark knapsack problems show that the heart algorithm is efficient and effective, which outperforms the other algorithms, in terms of the quality of solutions, reliability and convergence speed.

Online publication date: Thu, 05-Jan-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 Artificial Intelligence and Soft Computing (IJAISC):
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