Title: Solving knapsack problems using heart algorithm

Authors: Abdolreza Hatamlou; Elham Ghaniyarlou

Addresses: Department of Computer Science, Khoy Branch, Islamic Azad University, Khoy, Iran ' Department of Computer Science, Khoy Branch, Islamic Azad University, Khoy, Iran

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.

Keywords: knapsack problems; heart algorithm; optimisation; metaheuristics.

DOI: 10.1504/IJAISC.2016.081347

International Journal of Artificial Intelligence and Soft Computing, 2016 Vol.5 No.4, pp.285 - 293

Received: 12 Aug 2015
Accepted: 07 Jul 2016
Published online: 05 Jan 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article