Search

In this study, Mountain Gazelle Optimization (MGO) and Gazelle Optimization Algorithm (GOA) algorithms, which have been newly proposed in recent years, were examined. Although MGO and GOA are different heuristic algorithms, they are often considered the same algorithms by researchers. This study was conducted to resolve this confusion and demonstrate the discovery and exploitation success of both algorithms. While MGO developed the exploration and exploitation ability by being inspired by the behavior of gazelles living in different groups, GOA model was developed by being inspired by the behavior of gazelles in escaping from predators, reaching safe environments and grazing in safe environments. MGO and GOA were tested on 13 classical benchmark functions in seven different dimensions and their success was compared. According to the results, MGO is more successful than GOA in all dimensions. GOA, on the other hand, works faster than MGO. Additionally, MGO and GOA were tested on three different engineering design problems. While MGO was more successful in the tension/compression spring design problem and welded beam design problems, GOA achieved better results in the pressure vessel design problem. The results show that MGO improves the ability to explore and avoid local traps better than GOA. MGO and GOA are also compared with three different heuristic algorithms selected from the literature (GSO, COA, and ZOA). According to the results, MGO has shown that it can compete with new algorithms in the literature. GOA, on the other hand, lags behind comparison algorithms. [ABSTRACT FROM AUTHOR]

Arithmetic Optimization Algorithm (AOA) is a heuristic method developed in recent years. The original version was developed for continuous optimization problems. Its success in binary optimization problems has not yet been sufficiently tested. In this paper, the binary form of AOA (BinAOA) has been proposed. In addition, the candidate solution production scene of BinAOA is developed with the xor logic gate and the BinAOAX method was proposed. Both methods have been tested for success on well-known uncapacitated facility location problems (UFLPs) in the literature. The UFL problem is a binary optimization problem whose optimum results are known. In this study, the success of BinAOA and BinAOAX on UFLP was demonstrated for the first time. The results of BinAOA and BinAOAX methods were compared and discussed according to best, worst, mean, standard deviation, and gap values. The results of BinAOA and BinAOAX on UFLP are compared with binary heuristic methods used in the literature (TSA, JayaX, ISS, BinSSA, etc.). As a second application, the performances of BinAOA and BinAOAX algorithms are also tested on classical benchmark functions. The binary forms of AOA, AOAX, Jaya, Tree Seed Algorithm (TSA), and Gray Wolf Optimization (GWO) algorithms were compared in different candidate generation scenarios. The results showed that the binary form of AOA is successful and can be preferred as an alternative binary heuristic method. [ABSTRACT FROM AUTHOR]

The recently proposed Coati Optimization Algorithm (COA) is one of the swarm-based intelligence algorithms. In this study, the current COA algorithm is developed and Enhanced COA (ECOA) is proposed. There is an imbalance between the exploitation and exploration capabilities of the COA. To balance the exploration and exploitation capabilities of COA in the search space, the algorithm has been improved with two modifications. These modifications are those that preserve population diversity for a longer period of time during local and global searches. Thus, some of the drawbacks of COA in search strategies are eliminated. The achievements of COA and ECOA were tested in four different test groups. COA and ECOA were first compared on twenty-three classic CEC functions in three different dimensions (10, 20, and 30). Later, ECOA was tested on CEC-2017 with twenty-nine functions and on CEC-2020 with ten functions, and its success was demonstrated in different dimensions (5, 10, and 30). Finally, ECOA has been shown to be successful in different cycles (300, 500, and 1000) on Big Data Optimization Problems (BOP), which have high dimensions. Friedman and Wilcoxon tests were performed on the results, and the obtained results were analyzed in detail. According to the results, ECOA outperformed COA in all comparisons performed. In order to prove the success of ECOA, seven newly proposed algorithms (EMA, FHO, SHO, HBA, SMA, SOA, and JAYA) were selected from the literature in the last few years and compared with ECOA and COA. In the classical test functions, ECOA achieved the best results, surpassing all other algorithms when compared. It achieved the second-best results in CEC-2020 test functions and entered the top four in CEC-2017 and BOP test functions. According to the results, ECOA can be used as an alternative algorithm for solving small, medium, and large-scale continuous optimization problems. [ABSTRACT FROM AUTHOR]

Particle Swarm Optimization (PSO) is a commonly used optimization to solve many problems. The PSO, which is developed for continuous optimization, is updated to solve discrete problems and Discrete PSO (DPSO) is obtained in this study. With DPSO, the Traveling Salesman Problem (TSP), which is well-known in the literature as a discrete problem, is solved. In order to improve the results, the swap method, the shift method, and the symmetry method are added to DPSO. The symmetry method is a new and successful method. The variations of the DPSO occurred according to the selected method type (DPSO1 (swap method), DPSO2 (shift method), DPSO3 (swap and shift methods), DPSO4 (symmetry method), DPSO5 (swap, shift, and symmetry methods), DPSO6 (swap, shift, symmetry, and 2-opt methods)). The effect of each method on the performance of the DPSO has been studied in detail. To demonstrate the success of the variations of the DPSO, the results are additionally compared with many well-known and new discrete algorithms in the literature. The results showed that the performance of DPSO has improved with the symmetry method and it has achieved better results than the discrete heuristic algorithms recently proposed in the literature. [ABSTRACT FROM AUTHOR]