Numerical Optimization Using the Heart Algorithm

Numerical Optimization Using the Heart Algorithm

Abdolreza Hatamlou (Department of Computer Science, Khoy Branch, Islamic Azad University, Khoy, Iran)
Copyright: © 2018 |Pages: 5
DOI: 10.4018/IJAEC.2018040103

Abstract

In this article the authors investigate the application of the heart algorithm for solving unconstraint numerical optimization problems. Heart algorithms are a novel optimization algorithm which mimics the heart function and circulatory system procedure in the human beings. It starts with a number of candidate solutions for the given problem and utilizes the contraction and expansion actions to move the candidates in the search space for finding optimal solution. The applicability and performance of the heart algorithm for solving unconstrained optimization problems has been tested using several benchmark functions. Experimental results show its potential and superiority.
Article Preview

2. Heart Algorithm

Heart algorithm is an optimization algorithm which mimics the heart action and circulatory system in the human beings (Hatamlou, 2014). Similar to other evolutionary algorithms, the heart algorithm starts with a population of candidate solutions for the given problem. The initial population is generated and spread randomly over the search space. Then the objective function is calculated for population and the best candidate among population is chosen to be the heart and other candidates are considered as blood molecules.

After initialization of the population as heart and blood molecules, the population starts moving in the search space by simulating contraction and expansion actions of the biological heart. In this way, the heart attracts all other candidates and enforces them to move in the problem space and search for better solutions. The movement of candidates toward the heart is formulated using following equation:

(1)

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2019): Forthcoming, Available for Pre-Order
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing