Enhancement Political Optimizer Algorithm Based on Leader Redistribution Mechanism

Optimization algorithms are mathematical steps used to find an optimal solution from a set of possible solutions. These solutions usually require a long time, while optimization algorithms can find solutions quickly. Algorithms are typically combined to overcome algorithm weaknesses or improve performance. In this article, we have enhanced the Political Optimizer (PO) using a mechanism that randomly redistributes the leader's positions to increase the searching efficiency and overcome the problem of stagnation in the local solution. We aimed to redistribute the leaders' locations inside the election campaign process to open the road for the leaders to move to new areas. This idea was applied in critical conditions to have a little effect on the algorithm. The enhancement was promising, and the results improved well for the exploration and exploitation phases. We compared the performance of the enhancement algorithm with the classical political optimizer algorithm beside 13 different state-of-the-art algorithms. The evaluation occurred on 50 benchmark problems 25 were unimodal, and 25 were multi-model objective functions, while the mean result was completed to achieve the stability of the algorithms. The Enhanscemt Political Optimizer (EPO) achieved 23 optimal solutions and 13 close to the optimal solutions, while the results of the PO were 17 optimal and ten solutions close to the optimal. In terms of execution time, the algorithm was very promising, where the execution times in one run are (0.79336 ~ 0.16673) for the unimodal functions, while multi-model functions records (1.0874 ~ 0.16953) of highest and least values, respectively.