Topologies and performance of intelligent algorithms: a comprehensive review

Recently, optimization makes an important role in our day-to-day life. Evolutionary and population-based optimization algorithms are widely employed in several of engineering areas. The design of an optimization algorithm is a challenging endeavor caused of physical phenomena in order to obtain appropriate local and global search operators. Generally, local operators are fast. In contrast, global operators are used to find best solution in the search space; therefore they are slower compare to the local ones. The best review-knowledge of papers show that there are many optimization algorithms such as genetic algorithm, particle swarm optimization, artificial bee colony and etc in the engineering as a powerful tools. However, there is not a comprehensive review for theirs topologies and performance; therefore, the main goal of this paper is filling of this scientific gap. Moreover, several aspects of optimization heuristic designs and analysis are discussed in this paper. As a result, detailed explanation, comparison, and discussion on AI are achieved. Furthermore, some future research fields on AI are well summarized.