Kiziloluk, Soner; Özer, Ahmet Bedri

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.

AtıfScopus3·WoS1·OpenAlex3

İncele

Kiziloluk, Soner; Özer, Ahmet Bedri

Many of meta-heuristics optimization algorithms which are used to solving optimization problems are inspired from biological evolution, physical, social and chemical processes. Electromagnetism-like Algorithm (EM), Big Bang-Big Crunch Algorithm (BB-BC) and Gravitational Search Algorithm (GSA) are investigated in this study and they are physics-based meta-heuristics techniques. Performances of EM, BB-BC and GSA are compared by using Rastrigin, Rosenbrock and De Jong test functions.

AtıfWoS1

İncele

Özkaynak, Fatih; Özer, Ahmet Bedri

It is important to design cryptographically strong S-Boxes in order to design secure systems. In this study, a strong, chaos-based S-Box design is proposed. Continuous-time Lorenz system is chosen as the chaotic system. Proposed methodology is analyzed and tested for the following criteria: Bijective property, nonlinearity, strict avalanche criterion, output bits independence criterion and equiprobable input/output XOR distribution. The results of the analysis show that the proposed cryptosystem is a highly reliable system suitable for secure communication. (C) 2010 Elsevier B.V. All rights reserved.

AtıfWoS192·OpenAlex235

İncele