This paper proposes a novel global optimization algorithm called Political Optimizer (PO), inspired by the multi-phased process of politics. PO is the mathematical mapping of all the major phases of politics such as constituency allocation, party switching, election campaign, inter-party election, and parliamentary affairs. The proposed algorithm assigns each solution a dual role by logically dividing the population into political parties and constituencies, which facilitates each candidate to update its position with respect to the party leader and the constituency winner. Moreover, a novel position updating strategy called recent past-based position updating strategy (RPPUS) is introduced, which is the mathematical modeling of the learning behaviors of the politicians from the previous election. The proposed algorithm is benchmarked with 50 unimodal, multimodal, and fixed dimensional functions against 15 state of the art algorithms. We show through experiments that PO has an excellent convergence speed with good exploration capability in early iterations. Root cause of such behavior of PO is incorporation of RPPUS and logical division of the population to assign dual role to each candidate solution. Using Wilcoxon rank-sum test, PO demonstrates statistically significant performance over the other algorithms. The results show that PO outperforms all other algorithms, and consistency in performance on such a comprehensive suite of benchmark functions proves the versatility of the algorithm. Furthermore, experiments demonstrate that PO is invariant to function shifting and performs consistently in very high dimensional search spaces. Finally, the applicability on real-world applications is demonstrated by efficiently solving four engineering optimization problems.

Political Optimizer: A novel socio-inspired meta-heuristic for global optimization

In an organization, a group of people working for a common goal may not achieve their goal unless they organize themselves in a hierarchy called Corporate Rank Hierarchy (CRH). This principle motivates us to map the concept of CRH to propose a new algorithm for optimization that logically arranges the search agents in a hierarchy based on their fitness. The proposed algorithm is named as heap-based optimizer (HBO) because it utilizes the heap data structure to map the concept of CRH. The mathematical model of HBO is built on three pillars: the interaction between the subordinates and their immediate boss, the interaction between the colleagues, and self-contribution of the employees. The proposed algorithm is benchmarked with 97 diverse test functions including 29 CEC-BC-2017 functions with very challenging landscapes against 7 highly-cited optimization algorithms including the winner of CEC-BC-2017 (EBO-CMAR). In the first two experiments, the exploitative and explorative behavior of HBO is evaluated by using 24 unimodal and 44 multimodal functions, respectively. It is shown through experiments and Friedman mean rank test that HBO outperforms and secures 1 st rank. In the third experiment, we use 29 CEC-BC-2017 benchmark functions. According to Friedman mean rank test HBO attains 2 nd position after EBO-CMAR; however, the difference in ranks of HBO and EBO-CMAR is shown to be statistically insignificant by using Bonferroni method based multiple comparison test. Moreover, it is shown through the Friedman test that the overall rank of HBO is 1 st for all 97 benchmarks. In the fourth and the last experiment, the applicability on real-world problems is demonstrated by solving 3 constrained mechanical engineering optimization problems. The performance is shown to be superior or equivalent to the other algorithms, which have been used in the literature. The source code of HBO is publicly available at https://github.com/qamar-askari/HBO.

Heap-based optimizer inspired by corporate rank hierarchy for global optimization

Thank you very much for reading swarm intelligence from natural to artificial systems. As you may know, people have search hundreds times for their chosen books like this swarm intelligence from natural to artificial systems, but end up in malicious downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they juggled with some infectious bugs inside their computer.

Swarm Intelligence From Natural To Artificial Systems

https://www.econstor.eu/bitstream/10419/244066/1/1694151980.pdf

A new technique for optimal estimation of the circuit-based PEMFCs using developed Sunflower Optimization Algorithm

New optimal design for a hybrid solar chimney, solid oxide electrolysis and fuel cell based on improved deer hunting optimization algorithm

http://academic.oup.com/comjnl/advance-article-pdf/doi/10.1093/comjnl/bxy133/28700789/bxy133.pdf

Deer Hunting Optimization Algorithm: A New Nature-Inspired Meta-heuristic Paradigm

Image fusion can be widely explained as merging more than one photograph or a few in their factors right into a single photo without the creation of distortion or lack of information. Image fusion pastimes mix complementary as properly as approximate statistics for greater than one photograph to create fused photo output. Hence, the output picture achieved must have to include an extra accurate representation of the position than any of the man or woman supply pix and is greater fantastic for human visible, and pc understanding or in addition picture processing and comparison duties. . The notably used fusion rule is the most willpower scheme. This handy scheme chooses the biggest absolute wavelet coefficient at each location from the given snapshots because of the coefficient on the area within the fused photo. After that, the fused photo is obtained with the aid of using the inverse DWT for the corresponding wavelet coefficient. The well-known significantly used pixel-primarily based fusion rule is the aforementioned maximum favored scheme. This approach can choose the salient elements from the furnished photographs; however, it's miles touchy with noise and artifacts as they have been supposed to have better contrast. When the 2 photographs are degraded with the aid of using the wavelet transform, the approximation picture (low–frequency band) and thing image (high-frequency band) may additionally have one-of-a-type bodily meaning. In this project, a new fusion rule is proposed to feature a wavelet coefficient that treats low-frequency and high-frequency bands with high-quality fusion schemes.

S Praveena

Papers

Deer Hunting Optimization Algorithm: A New Nature-Inspired Meta-heuristic Paradigm

Image Fusion by Using Bi-Orthogonal Wavelets in Discrete Wavelet Transform (DWT) Domain