Journals / Turkish Journal of Electrical Engineering and Computer Science / 2019 / Cilt: 27 - Sayı: 3

Hybrid parliamentary optimization and big bang-big crunch algorithm for global optimization

Pages
1954–1969
Publication Date
2019-06-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The HPO-BBBC algorithm was found to achieve better optimization performance and a higher convergence speed than the above-mentioned algorithms on most benchmark problems.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Researchers have developed different metaheuristic algorithms to solve various optimization problems.
📊
Key Findings & Data:The performance of the HPO-BBBC algorithm was tested using well-known mathematical test functions and compared with that of the POA, the BB-BC algorithm, and some other metaheuristics, namely the genetic algorithm, multiverse optimizer, crow search algorithm, dragonfly algorithm, and moth-flame optimization algorithm.
💡
Conclusion & Impact:The HPO-BBBC algorithm was found to achieve better optimization performance and a higher convergence speed than the above-mentioned algorithms on most benchmark problems.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Parliamentary optimization algorithm · big bang-big crunch algorithm · global optimization

Abstract

Researchers have developed different metaheuristic algorithms to solve various optimization problems. The efficiency of a metaheuristic algorithm depends on the balance between exploration and exploitation. This paper presents the hybrid parliamentary optimization and big bang-big crunch (HPO-BBBC) algorithm, which is a combination of the parliamentary optimization algorithm (POA) and the big bang-big crunch (BB-BC) optimization algorithm. The intragroup competition phase of the POA is a process that searches for potential points in the search space, thereby providing an exploration mechanism. By contrast, the BB-BC algorithm has an effective exploitation mechanism. In the proposed method, steps of the BB-BC algorithm are added to the intragroup competition phase of the POA in order to improve the exploitation capabilities of the POA. Thus, the proposed method achieves a good balance between exploration and exploitation. The performance of the HPO-BBBC algorithm was tested using well-known mathematical test functions and compared with that of the POA, the BB-BC algorithm, and some other metaheuristics, namely the genetic algorithm, multiverse optimizer, crow search algorithm, dragonfly algorithm, and moth-flame optimization algorithm. The HPO-BBBC algorithm was found to achieve better optimization performance and a higher convergence speed than the above-mentioned algorithms on most benchmark problems.

🔖

Cite This Article

KIZILOLUK, S., ÖZER, A. B. (2019). Hybrid parliamentary optimization and big bang-big crunch algorithm for global optimization. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 27 - Sayı: 3, 1954–1969. https://ajindex.com/articles/186277

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...