Sürdürülebilir Kalkınma Amaçları
Yazarlar
Yayınlar
- MakaleAçık Erişim2019Scopus SJRQ3Hybrid parliamentary optimization and big bang-big crunch algorithm for global optimization
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ıfScopus3WoS1OpenAlex3
İncele - MakaleAçık Erişim2017Scopus SJRQ1Plant intelligence based metaheuristic optimization algorithms
Akyol, Sinem; Alatas, Bilal
Classical optimization algorithms are insufficient in large scale combinatorial problems and in nonlinear problems. Hence, metaheuristic optimization algorithms have been proposed. General purpose metaheuristic methods are evaluated in nine different groups: biology-based, physics-based, social-based, music-based, chemical-based, sport-based, mathematics-based, swarm-based, and hybrid methods which are combinations of these. Studies on plants in recent years have showed that plants exhibit intelligent behaviors. Accordingly, it is thought that plants have nervous system. In this work, all of the algorithms and applications about plant intelligence have been firstly collected and searched. Information is given about plant intelligence algorithms such as Flower Pollination Algorithm, Invasive Weed Optimization, Paddy Field Algorithm, Root Mass Optimization Algorithm, Artificial Plant Optimization Algorithm, Sapling Growing up Algorithm, Photosynthetic Algorithm, Plant Growth Optimization, Root Growth Algorithm, Strawberry Algorithm as Plant Propagation Algorithm, Runner Root Algorithm, Path Planning Algorithm, and Rooted Tree Optimization.
AtıfWoS188OpenAlex218İncele - MakaleAçık Erişim2017Performance comparisons of current metaheuristic algorithms on unconstrained optimization problems
Can, Umit; Alatas, Bilal
Nature-inspired metaheuristic algorithms have been recognized as powerful global optimization techniques in the last few decades.Many different metaheuristic optimization algorithms have been presented and successfully applied to different types of problems. In this paper; seven of newest metaheuristic algorithms namely, Ant Lion Optimization, Dragonfly Algorithm, Grey Wolf Optimization, Moth-Flame Optimization, Multi-Verse Optimizer, Sine Cosine Algorithm, and Whale Optimization Algorithm have been tested on unconstrained benchmark optimization problems and their performances have been reported. Some of these algorithms are based on swarm while some are based on biology and mathematics. Performance analysis of these novel search and optimization algorithms satisfying equal conditions on benchmark functions for the first time has given important information about their behaviors on unimodal and multi-modal optimization problems. These algorithms have been recently proposed and many new versions of them may be proposed in future for efficient results in many different types of search and optimization problems.
AtıfScopus12İncele