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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Artificial Intelligence and Soft Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
