Current Social-Based Heuristic Optimization Algorithms

Abstract

Optimization is the process of making something better. For example, in an f(x) function in optimization, it is asked for finding x values which make the values of the result minimum. Different methods have been proposed for solving optimization problems. Some of these processes have been inspired by natural processes. Ant colony optimization algorithm can be given as an example. Some of the other methods have been inspired by social events. Although the number of social based methods is limited, the most known one is tabu search algorithm. Recently, researchers have developed teaching-learning based algorithm, imperialist competitive algorithm, and parliamentary optimization algorithm. In this study, how the imperialist competitive algorithms and parliamentary optimization algorithms which are social-based algorithms are modeled and how parliamentary optimization algorithm is implemented on the problems have been mentioned.