Search

In recent years, there is massive development of new metaheuristics as stochastic methods. Meanwhile, there is not any metaheuristics is powerful to handle all problems as stated in the no-free-lunch (NFL) theory. Based on this circumstance, this paper introduces a new swarm-based metaheuristics with the main strategy moving toward the resultant of better swarm members and avoiding the resultant of worse swarm members called group better-worse algorithm (GBWA). It consists of five searches: moving toward the best swarm member, moving toward the resultant of better swarm members, moving away from the resultant of worse swarm members, searching locally, and jumping to the opposite area. GBWA is then evaluated in three ways. The first evaluation is a comparative evaluation where GBWA is compared to five recent metaheuristics: coati optimization algorithm (COA), average and subtraction-based optimization (ASBO), clouded leopard optimization (CLO), total interaction algorithm (TIA), and osprey optimization algorithm (OOA). The second evaluation is the individual search evaluation. The third evaluation is hyperparameter test. The collection of 23 classic functions is chosen as the use case in all evaluations. The result of the first evaluation shows that GBWA is better than COA, ASBO, CLO, TIA, and OOA in 20, 21, 20, 21, and 21 functions consecutively. Meanwhile, the result of the second evaluation shows the equal contribution between the motion toward the best swarm member and the motion toward the resultant of better swarm members. [ABSTRACT FROM AUTHOR]

The Honey Badger Algorithm (HBA) represents a novel swarm intelligence optimization algorithm introduced in recent years. However, its predominant constraints are linked to inadequate convergence accuracy and a vulnerability to entrapment in local optima. In an effort to mitigate these challenges, this paper introduces an Improved Honey Badger Algorithm Based on a Hybrid Strategy (OHBA). Firstly, during the population initialization phase, a method involving the utilization of a good point set is introduced to enhance the diversity and introduce more randomness into the population. Secondly, in the position update phase, the Beta distribution is employed as an alternative to the Uniform distribution, aiming to strike a balance between global exploration and local exploitation capabilities. Thirdly, an improved adaptive density factor strategy is incorporated into both global and local position updates to enhance the algorithm's convergence precision and speed. Lastly, within the global exploration stage, a Cauchy mutation strategy based on the Sine chaotic mapping is introduced to facilitate the algorithm in overcoming local optima and reinforcing its optimization capabilities. The improved algorithm's performance has been evaluated through a comprehensive set of assessments, including CEC-2017 functions, CEC-2022 functions, Wilcoxon rank-sum tests, and practical engineering optimization problems. These evaluations were undertaken to assess the algorithm in comparison to classical intelligent optimization algorithms. The experimental results show that OHBA possesses significant advantages in terms of convergence speed, optimization accuracy, robustness and its practical utility and effectiveness in addressing complex optimization challenges. This establishes OHBA as a highly competitive option in these critical aspects of optimization. [ABSTRACT FROM AUTHOR]

The social network embodies real-life social graphs. Detecting communities or clusters from these graphs is an ill-posed difficult task. The communities are identified using the adjacent nodes that have shared edges and similar features. One of the principal concerns after community detection is to identify the active nodes in a network who attend several communities. So, finding communities that are overlapped in a social network is an important topic in social network analysis. This paper introduces an algorithm based on the multi-agent particle swarm optimization. The proposed algorithm detects overlapping as well as non-overlapping communities. Following the detection of overlapping communities, this algorithm can identify those nodes leading to overlapping, and ultimately it can determine the affiliation ratio of each node to the given community. The algorithm uses a special type of coding to identify the number of communities without any prior knowledge. In this method, the modularity measure is used as a fitness function to optimize particle swarm. Several experiments show that the proposed algorithm which is called Fuzzy Overlapping Community Detection based on Multi-Agent Particle Swarm Optimization (FOCDMAPSO), is superior compared with four other competitive algorithms. This algorithm is implemented over six well-known datasets and five LFR datasets in the literature. Our algorithm is capable of detecting nodes in overlapping communities with high accuracy. Furthermore, the proposed algorithm can detect the affiliation percentage of each node that leads to overlapping communities which is a novel feature in the area of the social network. [ABSTRACT FROM AUTHOR]

This paper presents an optimal design and its realization of poly-phase induction motor using Quadratic Interpolation based Particle Swarm Optimization (QI-PSO). The optimization algorithm considers the efficiency, starting torque and temperature rise as objective function (which are considered separately) and nine performance related items as constraints. The QI-PSO algorithm was implemented on a test motor and the results are compared with the Simulated Annealing (SA) technique, Standard Particle Swarm Optimization (SPSO), and normal design. Some benchmark problems are used for validating QI-PSO. From the test results QI-PSO gave better results and more suitable to motor's design optimization. Optimized variables are realized by PC-IMD (Induction Motor Drives) of SPEED (Scottish Power Electronics and Electric Drives) software. C++ code is used for implementing entire algorithms. [ABSTRACT FROM AUTHOR]

How to manage trade-off between exploitation and exploration in Particle Swarm Optimization (PSO) for efficiently solving various optimization problems is an important issue. In order to prevent premature convergence in PSO search, this paper proposes a new method, Particle Swarm Optimization with Diversive Curiosity (PSO/DC). A key idea of the proposed method is to introduce a mechanism of diversive curiosity into PSO for preventing premature convergence and for managing the exploration-exploitation trade-off. Diversive curiosity is represented by an internal indicator that detects marginal improvement of a swarm of particles for certain number of iterations, and forces them to continually explore an optimal solution to a given optimization problem. Applications of the proposed method to a 2-dimensional optimization problem well demonstrate its effectiveness. Our experimental results indicate that the performance (100%) by the proposed method is superior in terms of success ratio to that (60%) by the PSO model optimized by EPSO, and basically accord with the finding called "the zone of curiosity" in psychology. [ABSTRACT FROM AUTHOR]