Search

Quantum machine learning stands out as one of the most promising applications of quantum computing, widely believed to possess potential quantum advantages. In the era of noisy intermediate-scale quantum, the scale and quality of quantum computers are limited, and quantum algorithms based on fault-tolerant quantum computing paradigms cannot be experimentally verified in the short term. The variational quantum algorithm design paradigm can better adapt to the practical characteristics of noisy quantum hardware and is currently one of the most promising solutions. However, variational quantum algorithms, due to their highly entangled nature, encounter the phenomenon known as the "barren plateau" during the optimization and training processes, making effective optimization challenging. This paper addresses this challenging issue by researching a variational quantum neural network optimization method based on collective intelligence algorithms. The aim is to overcome optimization difficulties encountered by traditional methods such as gradient descent. We study two typical applications of using quantum neural networks: random 2D Hamiltonian ground state solving and quantum phase recognition. We find that the collective intelligence algorithm shows a better optimization compared to gradient descent. The solution accuracy of ground energy and phase classification is enhanced, and the optimization iterations are also reduced. We highlight that the collective intelligence algorithm has great potential in tackling the optimization of variational quantum algorithms. [ABSTRACT FROM AUTHOR]

The Whale Optimization Algorithm (WOA) is a swarm intelligence algorithm based on natural heuristics, which has gained considerable attention from researchers and engineers. However, WOA still has some limitations, including limited global search efficiency and a slow convergence rate. To address these issues, this paper presents an improved whale optimization algorithm with multiple strategies, called Dynamic Gain-Sharing Whale Optimization Algorithm (DGSWOA). Specifically, a Sine–Tent–Cosine map is first adopted to more effectively initialize the population, ensuring a more uniform distribution of individuals across the search space. Then, a gaining–sharing knowledge based algorithm is used to enhance global search capability and avoid falling into a local optimum. Finally, to increase the diversity of solutions, Dynamic Opposition-Based Learning is incorporated for population updating. The effectiveness of our approach is evaluated through comparative experiments on blackbox optimization benchmarking and two engineering application problems. The experimental results suggest that the proposed method is competitive in terms of solution quality and convergence speed in most cases. [ABSTRACT FROM AUTHOR]

This paper presents a method for unsupervised classification of entities by a group of agents with unknown domains and levels of expertise. In contrast to the existing methods based on majority voting ("wisdom of the crowd") and their extensions by expectation-maximization procedures, the suggested method first determines the levels of the agents' expertise and then weights their opinions by their expertise level. In particular, we assume that agents will have relatively closer classifications in their field of expertise. Therefore, the expert agents are recognized by using a weighted Hamming distance between their classifications, and then the final classification of the group is determined from the agents' classifications by expectation-maximization techniques, with preference to the recognized experts. The algorithm was verified and tested on simulated and real-world datasets and benchmarked against known existing algorithms. We show that such a method reduces incorrect classifications and effectively solves the problem of unsupervised collaborative classification under uncertainty, while outperforming other known methods. [ABSTRACT FROM AUTHOR]

This paper provides a real application of a popular swarm-intelligence optimisation method. The aim is to analyse the efficiency of various settings of the marine predator algorithm (MPA). Four crucial numerical parameters of the MPA are statistically analysed to propose the most efficient setting for solving engineering problems. Besides population size, particle velocity parameter P, Lévy flight parameter β , and fish aggregating device (FAD) probabilities are studied. Finally, 193 various settings, including fixed values and dynamic changes of the MPA parameters, are experimentally compared when solving 13 engineering problems. Standard statistical approaches are employed to highlight significant differences in various MPA settings. The setting of two MPA parameters (P, FADs) significantly influences MPA performance. Three newly proposed MPA settings outperform the original variant significantly. The best results provide the MPA variant with the dynamic linear change of P from 0.5 to 0. These parameters influence the velocity of prey and predator individuals in all three stages of the MPA search process. Decreasing the value of P showed that decreasing the velocity of individuals during the search provides good performance. Further, lower efficiency of the MPA with higher FAD values was detected. It means that more occasional use of fish aggregating devices (FADs) can increase the solvability of engineering problems. Regarding population size, lower values ( N = 10 ) provided significantly better results compared with the higher values ( N = 500 ). [ABSTRACT FROM AUTHOR]

Accurate parameter estimation is crucial and challenging for the design and modeling of PV cells/modules. However, the high degree of non-linearity of the typical I–V characteristic further complicates this task. Consequently, significant research interest has been generated in recent years. Currently, this trend has been marked by a noteworthy acceleration, mainly due to the rise of swarm intelligence and the rapid progress of computer technology. This paper proposes a developed Mountain Gazelle Optimizer (MGO) to generate the best values of the unknown parameters of PV generation units. The MGO mimics the social life and hierarchy of mountain gazelles in the wild. The MGO was compared with well-recognized recent algorithms, which were the Grey Wolf Optimizer (GWO), the Squirrel Search Algorithm (SSA), the Differential Evolution (DE) algorithm, the Bat–Artificial Bee Colony Optimizer (BABCO), the Bat Algorithm (BA), Multiswarm Spiral Leader Particle Swarm Optimization (M-SLPSO), the Guaranteed Convergence Particle Swarm Optimization algorithm (GCPSO), Triple-Phase Teaching–Learning-Based Optimization (TPTLBO), the Criss-Cross-based Nelder–Mead simplex Gradient-Based Optimizer (CCNMGBO), the quasi-Opposition-Based Learning Whale Optimization Algorithm (OBLWOA), and the Fractional Chaotic Ensemble Particle Swarm Optimizer (FC-EPSO). The experimental findings and statistical studies proved that the MGO outperformed the competing techniques in identifying the parameters of the Single-Diode Model (SDM) and the Double-Diode Model (DDM) PV models of Photowatt-PWP201 (polycrystalline) and STM6-40/36 (monocrystalline). The RMSEs of the MGO on the SDM and the DDM of Photowatt-PWP201 and STM6-40/36 were 2.042717 × 10 − 3 , 1.387641 × 10 − 3 , 1.719946 × 10 − 3 , and 1.686104 × 10 − 3 , respectively. Overall, the identified results highlighted that the MGO-based approach featured a fast processing time and steady convergence while retaining a high level of accuracy in the achieved solution. [ABSTRACT FROM AUTHOR]

Association rule mining (ARM) is one of the most important tasks in data mining. In recent years, swarm intelligence algorithms have been effectively applied to ARM, and the main challenge has been to achieve a balance between search efficiency and the quality of the mined rules. As a novel swarm intelligence algorithm, the water wave optimization (WWO) algorithm has been widely used for combinatorial optimization problems, with the disadvantage that it tends to fall into local optimum solutions and converges slowly. In this paper, a novel hybrid ARM method based on WWO with Levy flight (LWWO) is proposed. The proposed method improves the solution of WWO by expanding the search space through Levy flight while effectively increasing the search speed. In addition, this paper employs the hybrid strategy to enhance the diversity of the population in order to obtain the global optimal solution. Moreover, the proposed ARM method does not generate frequent items, unlike traditional algorithms (e.g., Apriori), thus reducing the computational overhead and saving memory space, which increases its applicability in real-world business cases. Experiment results show that the performance of the proposed hybrid algorithms is significantly better than that of the WWO and LWWO in terms of quality and number of mined rules. [ABSTRACT FROM AUTHOR]

This paper provides a survey of recent research progress in mathematical modeling and distributed control of wide-area networks. Firstly, the modeling is introduced for two types of wide-area networks, i.e., coopetitive networks and cooperative networks, with the help of algebraic graph theory. Particularly, bipartite network topologies and cluster network topologies are introduced for coopetitive networks. With respect to cooperative networks, an intermittent clustered network modeling is presented. Then, some classical distributed control strategies are reviewed for wide-area networks to ensure some desired collective behaviors, such as consensus (or synchronization), bipartite consensus (or polarization), and cluster consensus (or fragmentation). Finally, some conclusions and future directions are summarized. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization algorithms play a crucial role in optimization problems. However, the traditional identification methods have the following problems: (1) difficulties in nonlinear data processing; (2) high error rates caused by local stagnation; and (3) low classification rates resulting from premature convergence. This paper proposed a variant based on the gray wolf optimization algorithm (GWO) with chaotic disturbance, candidate migration, and attacking mechanisms, naming it the enhanced gray wolf optimizer (EGWO), to solve the problem of premature convergence and local stagnation. The performance of the EGWO was tested on IEEE CEC 2014 benchmark functions, and the results of the EGWO were compared with the performance of three GWO variants, five traditional and popular algorithms, and six recent algorithms. In addition, EGWO optimized the weights and biases of a multi-layer perceptron (MLP) and proposed an EGWO-MLP disease identification model; the model was tested on IEEE CEC 2014 benchmark functions, and EGWO-MLP was verified by UCI dataset including Tic-Tac-Toe, Heart, XOR, and Balloon datasets. The experimental results demonstrate that the proposed EGWO-MLP model can effectively avoid local optimization problems and premature convergence and provide a quasi-optimal solution for the optimization problem. [ABSTRACT FROM AUTHOR]

Community discovery (CD) under complex networks is a hot discussion issue in network science research. Recently, many evolutionary methods have been introduced to detect communities of networks. However, evolutionary optimization-based community discovery still suffers from two problems. First, the initialization population quality of the current evolutionary algorithm is not good, resulting in slow convergence speed, and the final performance needs to be further improved. Another important issue is that current methods of CD have inconsistent network detection performance at different scales, showing a dramatic drop as the network scale increases. To address such issues, this paper proposes an algorithm based on the novel initial method and improved gray wolf optimization (NIGWO) to tackle the above two problems at the same time. In this paper, a novel initialization strategy is proposed to generate a high-quality initial population and greatly accelerate the convergence speed of population evolution. The strategy effectively fused the elite substructure of the community and different features based on the dependency and other features among nodes. Moreover, an improved GWO is presented with two new search strategies. An improved hunting prey stage is proposed to retain the excellent substructures of populations and quickly improve the community structure. Furthermore, new mutation strategies from node level to community level are designed in an improved encircling prey stage. Specifically, boundary nodes are mutated according to a proposed function to improve the search efficiency and save the computation assumption. Numerous experiments have proven our method obtains more excellent performance in most networks compared with 11 state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Recycling tasks are the most effective method for reducing waste generation, protecting the environment, and boosting the overall national economy. The productivity and effectiveness of the recycling process are strongly dependent on the cleanliness and precision of processed primary sources. However, recycling operations are often labor intensive, and computer vision and deep learning (DL) techniques aid in automatically detecting and classifying trash types during recycling chores. Due to the dimensional challenge posed by pre-trained CNN networks, the scientific community has developed numerous techniques inspired by biology, swarm intelligence theory, physics, and mathematical rules. This research applies a new meta-heuristic algorithm called the artificial hummingbird algorithm (AHA) to solving the waste classification problem based on feature selection. However, the performance of the AHA is barely satisfactory; it may be stuck in optimal local regions or have a slow convergence. To overcome these limitations, this paper develops two improved versions of the AHA called the AHA-ROBL and the AHA-OBL. These two versions enhance the exploitation stage by using random opposition-based learning (ROBL) and opposition-based learning (OBL) to prevent local optima and accelerate the convergence. The main purpose of this paper is to apply the AHA-ROBL and AHA-OBL to select the relevant deep features provided by two pre-trained models of CNN (VGG19 & ResNet20) to recognize a waste classification. The TrashNet dataset is used to verify the performance of the two proposed approaches (the AHA-ROBL and AHA-OBL). The effectiveness of the suggested methods (the AHA-ROBL and AHA-OBL) is compared with that of 12 modern and competitive optimizers, namely the artificial hummingbird algorithm (AHA), Harris hawks optimizer (HHO), Salp swarm algorithm (SSA), aquila optimizer (AO), Henry gas solubility optimizer (HGSO), particle swarm optimizer (PSO), grey wolf optimizer (GWO), Archimedes optimization algorithm (AOA), manta ray foraging optimizer (MRFO), sine cosine algorithm (SCA), marine predators algorithm (MPA), and rescue optimization algorithm (SAR). A fair evaluation of the proposed algorithms' performance is achieved using the same dataset. The performance analysis of the two proposed algorithms is applied in terms of different measures. The experimental results confirm the two proposed algorithms' superiority over other comparative algorithms. The AHA-ROBL and AHA-OBL produce the optimal number of selected features with the highest degree of precision. [ABSTRACT FROM AUTHOR]

Higher accuracy in cluster failure prediction can ensure the long-term stable operation of cluster systems and effectively alleviate energy losses caused by system failures. Previous works have mostly employed BP neural networks (BPNNs) to predict system faults, but this approach suffers from reduced prediction accuracy due to the inappropriate initialization of weights and thresholds. To address these issues, this paper proposes an improved arithmetic optimization algorithm (AOA) to optimize the initial weights and thresholds in BPNNs. Specifically, we first introduced an improved AOA via multi-subpopulation and comprehensive learning strategies, called MCLAOA. This approach employed multi-subpopulations to effectively alleviate the poor global exploration performance caused by a single elite, and the comprehensive learning strategy enhanced the exploitation performance via information exchange among individuals. More importantly, a nonlinear strategy with a tangent function was designed to ensure a smooth balance and transition between exploration and exploitation. Secondly, the proposed MCLAOA was utilized to optimize the initial weights and thresholds of BPNNs in cluster fault prediction, which could enhance the accuracy of fault prediction models. Finally, the experimental results for 23 benchmark functions, CEC2020 benchmark problems, and two engineering examples demonstrated that the proposed MCLAOA outperformed other swarm intelligence algorithms. For the 23 benchmark functions, it improved the optimal solutions in 16 functions compared to the basic AOA. The proposed fault prediction model achieved comparable performance to other swarm-intelligence-based BPNN models. Compared to basic BPNNs and AOA-BPNNs, the MCLAOA-BPNN showed improvements of 2.0538 and 0.8762 in terms of mean absolute percentage error, respectively. [ABSTRACT FROM AUTHOR]

The firefly algorithm (FA) is a meta-heuristic swarm intelligence optimization algorithm. It simulates the social behavior of fireflies with their flash and attraction characteristics. Numerous researches showed that FA can successfully deal with some problems. However, too many attractions between the fireflies may result in high computational complexity, slow convergence, low solution accuracy and poor algorithm stability. To overcome these issues, this paper proposes an enhanced firefly algorithm with dual-population topology coevolution (DPTCFA). In DPTCFA, to maintain population diversity, a dual-population topology coevolution mechanism consisting of the scale-free and ring network topology is proposed. The scale-free network topology structure conforms to the distribution law between the optimal and potential individuals, and the ring network topology effectively reduces the attractions, and thereby has a low computational complexity. The Gauss map strategy is introduced in the scale-free network topology population to lower parameter sensitivity, and in the ring network topology population, a new distance strategy based on dimension difference is adopted to speed up the convergence. This paper improves a diversity neighborhood enhanced search strategy for firefly position update to increase the solution quality. In order to balance the exploration and exploitation, a staged balance mechanism is designed to enhance the algorithm stability. Finally, the performance of the proposed algorithm is verified via several well-known benchmark functions. Experiment results show that DPTCFA can efficiently improve the existing problems of FA to obtain better solutions. [ABSTRACT FROM AUTHOR]

Optimization is a broad field for researchers to develop new algorithms for solving various types of problems. There are various popular techniques being worked on for improvement. Grey wolf optimization (GWO) is one such algorithm because it is efficient, simple to use, and easy to implement. However, GWO has several drawbacks as it is stuck in local optima, has a low convergence rate, and has poor exploration. Several attempts have been made recently to overcome these drawbacks. This paper discusses some strategies that can be applied to GWO to overcome its drawbacks. This article proposes a novel algorithm to enhance the convergence rate, which was poor in GWO, and it is also compared with the other optimization algorithms. GWO also has the limitation of becoming stuck in local optima when used in complex functions or in a large search space, so these issues are further addressed. The most remarkable factor is that GWO purely depends on the initialization constraints such as population size and wolf initial positions. This study demonstrates the improved position of the wolf by applying strategies with the same population size. As a result, this novel algorithm has enhanced its exploration capability compared to other algorithms presented, and statistical results are also presented to demonstrate its superiority. [ABSTRACT FROM AUTHOR]

Distributed computing, e.g., cluster and cloud computing, has been applied in almost all areas for data processing, while high resource efficiency and user satisfaction are still the ambition of distributed computing. Task scheduling is indispensable for achieving the goal. As the task scheduling problem is NP-hard, heuristics and meta-heuristics are frequently applied. Every method has its own advantages and limitations. Thus, in this paper, we designed a hybrid heuristic task scheduling problem by exploiting the high global search ability of the Genetic Algorithm (GA) and the fast convergence of Particle Swarm Optimization (PSO). Different from existing hybrid heuristic approaches that simply sequentially perform two or more algorithms, the PGA applies the evolutionary method of a GA and integrates self- and social cognitions into the evolution. We conduct extensive simulated environments for the performance evaluation, where simulation parameters are set referring to some recent related works. Experimental results show that the PGA has 27.9–65.4% and 33.8–69.6% better performance than several recent works, on average, in user satisfaction and resource efficiency, respectively. [ABSTRACT FROM AUTHOR]

Recently, the use of acoustic echo canceller (AEC) systems in portable devices has significantly increased. Therefore, the need for superior audio quality in resource-constrained devices opens new horizons in the creation of high-convergence speed adaptive algorithms and optimal digital designs. Nowadays, AEC systems mainly use the least mean square (LMS) algorithm, since its implementation in digital hardware architectures demands low area consumption. However, its performance in acoustic echo cancellation is limited. In addition, this algorithm presents local convergence optimization problems. Recently, new approaches, based on stochastic optimization algorithms, have emerged to increase the probability of encountering the global minimum. However, the simulation of these algorithms requires high-performance computational systems. As a consequence, these algorithms have only been conceived as theoretical approaches. Therefore, the creation of a low-complexity algorithm potentially allows the development of compact AEC hardware architectures. In this paper, we propose a new convex combination, based on grey wolf optimization and LMS algorithms, to save area and achieve high convergence speed by exploiting to the maximum the best features of each algorithm. In addition, the proposed convex combination algorithm shows superior tracking capabilities when compared with existing approaches. Furthermore, we present a new neuromorphic hardware architecture to simulate the proposed convex combination. Specifically, we present a customized time-multiplexing control scheme to dynamically vary the number of search agents. To demonstrate the high computational capabilities of this architecture, we performed exhaustive testing. In this way, we proved that it can be used in real-world acoustic echo cancellation scenarios. [ABSTRACT FROM AUTHOR]

The Competitive Swarm Optimizer (CSO) has emerged as a prominent technique for solving intricate optimization problems by updating only half of the population in each iteration. Despite its effectiveness, the CSO algorithm often exhibits a slow convergence rate and a tendency to become trapped in local optimal solutions, as is common among metaheuristic algorithms. To address these challenges, this paper proposes a hybrid approach combining the CSO with the Salp Swarm algorithm (SSA), CL-SSA, to increase the convergence rate and enhance search space exploration. The proposed approach involves a two-step process. In the first step, a pairwise competition mechanism is introduced to segregate the solutions into winners and losers. The winning population is updated through strong exploitation using the SSA algorithm. In the second step, non-winning solutions learn from the winners, achieving a balance between exploration and exploitation. The performance of the CL-SSA is evaluated on various benchmark functions, including the CEC2017 benchmark with dimensions 50 and 100, the CEC2008lsgo benchmark with dimensions 200, 500 and 1000, as well as a set of seven well-known constrained design challenges in various engineering domains defined in the CEC2020 conference. The CL-SSA is compared to other metaheuristics and advanced algorithms, and its results are analyzed through statistical tests such as the Friedman and Wilcoxon rank-sum tests. The statistical analysis demonstrates that the CL-SSA algorithm exhibits improved exploitation, exploration, and convergence patterns compared to other algorithms, including SSA and CSO, as well as popular algorithms. Furthermore, the proposed hybrid approach performs better in solving most test functions. [ABSTRACT FROM AUTHOR]

In this paper, we study swarm intelligence computation for constrained optimization problems and propose a new hybrid PSO-DE algorithm based on feasibility rules. Establishing individual feasibility rules as a way to determine whether the position of an individual satisfies the constraint or violates the degree of the constraint, which will determine the choice of the individual optimal position and the global optimal position in the particle population. First, particle swarm optimization (PSO) is used to act on the top 50% of individuals with higher degree of constraint violation to update their velocity and position. Second, Differential Evolution (DE) is applied to act on the individual optimal position of each individual to form a new population. The current individual optimal position and the global optimal position are updated using the feasibility rules, thus forming a hybrid PSO-DE intelligent algorithm. Analyzing the convergence and complexity of PSO-DE. Finally, the performance of the PSO-DE algorithm is tested with 12 benchmark functions of constrained optimization and 57 engineering optimization problems, the numerical results show that the proposed algorithm has good accuracy, effectiveness and robustness. [ABSTRACT FROM AUTHOR]

The increased usage of cyber-physical systems (CPS) has gained the focus of cybercriminals, particularly with the involvement of the internet, provoking an increased attack surface. The increased usage of these systems generates heavy data flows, which must be analyzed to ensure security. In particular, machine learning (ML) and deep learning (DL) algorithms have shown feasibility and promising results to fulfill the security requirement through the adoption of intelligence. However, the performance of these models strongly depends on the model structure, hyper-parameters, dataset, and application. So, the developers only possess control over defining the model structure and its hyper-parameters for diversified applications. Generally, not all models perform well in default hyper-parameter settings. Their specification is a challenging and complex task and requires significant expertise. This problem can be mitigated by utilizing hyper-parameter optimization (HPO) techniques, which intend to automatically find efficient learning model hyper-parameters in specific applications or datasets. This paper proposes an enhanced intelligent security mechanism for CPS by utilizing HPO. Specifically, exhaustive HPO techniques have been considered for performance evaluation and evaluation of computational requirements to analyze their capabilities to build an effective intelligent security model to cope with security infringements in CPS. Moreover, we analyze the capabilities of various HPO techniques, normalization, and feature selection. To ensure the HPO, we evaluated the effectiveness of a DL-based artificial neural network (ANN) on a standard CPS dataset under manual hyper-parameter settings and exhaustive HPO techniques, such as random search, directed grid search, and Bayesian optimization. We utilized the min-max algorithm for normalization and SelectKBest for feature selection. The HPO techniques performed better than the manual hyper-parameter settings. They achieved an accuracy, precision, recall, and F1 score of more than 98%. The results highlight the importance of HPO for performance enhancement and reduction of computational requirements, human efforts, and expertise. [ABSTRACT FROM AUTHOR]

Public goods games have been extensively studied to determine the mechanism behind cooperation in social dilemmas. Previous public goods games based on particle swarm algorithms enabled individuals to integrate their past best strategies with the current best strategies of their neighbors, which can effectively promote cooperation. In this paper, we introduce the concept of memory stability and explore the effects of different memory stability coefficients on strategy distribution, strategy update rate, and average cooperation level. Our simulation results showed that, in the case of a very high propensity coefficient, infinite memory stability coefficients cannot reach a high level of cooperation, while reducing memory stability can reach a very high level of cooperation. At a low enhancement factor, weakening memory stability decreased the average cooperation level, while at a higher enhancement factor, a weakening memory stability greatly increased the average group cooperation level. Our study provides new insights into the application of particle swarm algorithms to public goods games. [ABSTRACT FROM AUTHOR]

Reporting the empirical results of swarm and evolutionary computation algorithms is a challenging task with many possible difficulties. These difficulties stem from the stochastic nature of such algorithms, as well as their inability to guarantee an optimal solution in polynomial time. This research deals with measuring the performance of stochastic optimization algorithms, as well as the confidence intervals of the empirically obtained statistics. Traditionally, the arithmetic mean is used for measuring average performance, but we propose quantiles for measuring average, peak and bad-case performance, and give their interpretations in a relevant context for measuring the performance of the metaheuristics. In order to investigate the differences between arithmetic mean and quantiles, and to confirm possible benefits, we conducted experiments with 7 stochastic algorithms and 20 unconstrained continuous variable optimization problems. The experiments showed that median was a better measure of average performance than arithmetic mean, based on the observed solution quality. Out of 20 problem instances, a discrepancy between the arithmetic mean and median happened in 6 instances, out of which 5 were resolved in favor of median and 1 instance remained unresolved as a near tie. The arithmetic mean was completely inadequate for measuring average performance based on the observed number of function evaluations, while the 0.5 quantile (median) was suitable for that task. The quantiles also showed to be adequate for assessing peak performance and bad-case performance. In this paper, we also proposed a bootstrap method to calculate the confidence intervals of the probability of the empirically obtained quantiles. Considering the many advantages of using quantiles, including the ability to calculate probabilities of success in the case of multiple executions of the algorithm and the practically useful method of calculating confidence intervals, we recommend quantiles as the standard measure of peak, average and bad-case performance of stochastic optimization algorithms. [ABSTRACT FROM AUTHOR]

Formation control is one of the most concerning topics within the realm of swarm intelligence. This paper presents a metaheuristic approach that leverages a natural co-evolutionary strategy to solve the formation control problem for a swarm of missiles. The missile swarm is modeled by a second-order system with a heterogeneous reference target, and the exponential of the resultant error is accumulated to be the objective function such that the swarm converges to optimal equilibrium states satisfying specific formation requirements. Focusing on the issue of the local optimum and unstable evolution, we incorporate a novel model-based policy constraint and a population adaptation strategy that significantly alleviates the performance degradation of the existing natural co-evolutionary strategy in terms of slow training and instability of convergence. With application of the Molloy–Reed criterion in the field of network communication, we developed an adaptive topology method that assures connectivity under node failure, and its effectiveness is validated theoretically and experimentally. The experimental results demonstrate that the accuracy of formation flight achieved by this method is competitive with that of conventional control methods and is much more adaptable. More significantly, we show that it is feasible to treat the generic formation control problem as an optimal control problem for finding a Nash equilibrium strategy and solving it through iterative learning. [ABSTRACT FROM AUTHOR]

Mobile robots are relevant dynamic systems in recent applications. Path planning is an essential task for these robots since it allows them to move from one location to another safely and at an affordable cost. Path planning has been studied extensively for static scenarios. However, when the scenarios are dynamic, research is limited due to the complexity and high cost of continuously re-planning the robot's movements to ensure its safety. This paper proposes a new, simple, reliable, and affordable method to plan safe and optimized paths for differential mobile robots in dynamic scenarios. The method is based on the online re-optimization of the static parameters in the state-of-the-art deterministic path planner Bug0. Due to the complexity of the dynamic path planning problem, a metaheuristic optimization approach is adopted. This approach utilizes metaheuristics from evolutionary computation and swarm intelligence to find the Bug0 parameters when the mobile robot is approaching an obstacle. The proposal is tested in simulation, and well-known metaheuristic methods are compared, including Differential Evolution (DE), the Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). The dynamic planner based on PSO generates paths with the best performances. In addition, the results of the PSO-based planner are compared with different Bug0 configurations, and the former is shown to be significantly better. [ABSTRACT FROM AUTHOR]

Optimization problems are prevalent in almost all areas and hence optimization algorithms are crucial for a myriad of real-world applications. Deterministic optimization algorithms tend to be computationally costly and time-consuming. Hence, heuristic and metaheuristic algorithms are more favoured as they provide near-optimal solutions in an acceptable amount of time. Swarm intelligence algorithms are being increasingly used for optimization problems owing to their simplicity and good performance. The Dragonfly Algorithm (DA) is one which is inspired by the swarming behaviours of dragonflies, and it has been proven to have a superior performance than other algorithms in multiple applications. Hence, it is worth considering its application to the traveling salesman problem which is a predominant discrete optimization problem. The original DA is only suitable for solving continuous optimization problems and, although there is a binary version of the algorithm, it is not easily adapted for solving discrete optimization problems like TSP. We have previously proposed a discrete adapted DA algorithm suitable for TSP. However, it has low effectiveness, and it has not been used for large TSP problems. In this paper, we propose an optimized discrete adapted DA by using the steepest ascent hill climbing algorithm as a local search. The algorithm is applied to a TSP problem modelling a package delivery system in the Kuala Lumpur area and to benchmark TSP problems, and it is found to have a higher effectiveness than the discrete adapted DA and some other swarm intelligence algorithms. It also has a higher efficiency than the discrete adapted DA. [ABSTRACT FROM AUTHOR]

Technological development has brought humanity to the era of an information society in which information is the main driver. This implies existing large amounts of data from which knowledge should be extracted. In this sense, artificial intelligence represents a trend applied in many areas of human activity. This paper is focused on ensemble modeling based on the use of several machine learning algorithms, which enable the prediction of the risk to human health due to the state of atmospheric factors. The model uses two multi-agents as a technique of emergent intelligence to make a collective decision. The first agent makes a partial decision on the prediction task by learning from the available historical data. In contrast, the second agent does the same from the data available in real-time. The proposed prediction model was evaluated in a case study related to the city of Niš, Republic of Serbia, and showed a better result than each algorithm separately. It represents a reasonable basis for further upgrading both in the scope of different groups of the atmospheric parameters and in the methodological sense, as well as technically through implementation in a practical web citizen service. [ABSTRACT FROM AUTHOR]

Many metaheuristic approaches have been developed to select effective features from different medical datasets in a feasible time. However, most of them cannot scale well to large medical datasets, where they fail to maximize the classification accuracy and simultaneously minimize the number of selected features. Therefore, this paper is devoted to developing an efficient binary version of the quantum-based avian navigation optimizer algorithm (QANA) named BQANA, utilizing the scalability of the QANA to effectively select the optimal feature subset from high-dimensional medical datasets using two different approaches. In the first approach, several binary versions of the QANA are developed using S-shaped, V-shaped, U-shaped, Z-shaped, and quadratic transfer functions to map the continuous solutions of the canonical QANA to binary ones. In the second approach, the QANA is mapped to binary space by converting each variable to 0 or 1 using a threshold. To evaluate the proposed algorithm, first, all binary versions of the QANA are assessed on different medical datasets with varied feature sizes, including Pima, HeartEW, Lymphography, SPECT Heart, PenglungEW, Parkinson, Colon, SRBCT, Leukemia, and Prostate tumor. The results show that the BQANA developed by the second approach is superior to other binary versions of the QANA to find the optimal feature subset from the medical datasets. Then, the BQANA was compared with nine well-known binary metaheuristic algorithms, and the results were statistically assessed using the Friedman test. The experimental and statistical results demonstrate that the proposed BQANA has merit for feature selection from medical datasets. [ABSTRACT FROM AUTHOR]

The Teaching Learning-Based Algorithm (TLBA) is a powerful and effective optimization approach. TLBA mimics the teaching-learning process in a classroom, where TLBA's iterative computing process is separated into two phases, unlike standard evolutionary algorithms and swarm intelligence algorithms, and each phase conducts an iterative learning operation. Advanced technologies of Voltage Source Converters (VSCs) enable greater active and reactive power regulation in these networks. Various objectives are addressed for optimal energy management, with the goal of attaining economic and technical advantages by decreasing overall production fuel costs and transmission power losses in AC-DC transmission networks. In this paper, the TLBA is applied for various sorts of nonlinear and multimodal functioning of hybrid alternating current (AC) and multi-terminal direct current (DC) power grids. The proposed TLBA is evaluated on modified IEEE 30-bus and IEEE 57-bus AC-DC networks and compared to other published methods in the literature. Numerical results demonstrate that the proposed TLBA has great effectiveness and robustness indices over the others. Economically, the reduction percentages of 13.84 and 21.94% are achieved for the IEEE 30-bus and IEEE 57-bus test systems when the fuel costs are minimized. Technically, significant improvement in the transmission power losses with reduction 28.01% and 69.83%, are found for the IEEE 30-bus and IEEE 57-bus test system compared to the initial case. Nevertheless, TLBA has faster convergence, higher quality for the final optimal solution, and more power for escaping from convergence to local optima compared to other published methods in the literature. [ABSTRACT FROM AUTHOR]

Recent advances in online payment technologies combined with the impact of the COVID-19 global pandemic has led to a significant escalation in the number of online transactions and credit card payments being executed every day. Naturally, there has also been an escalation in credit card frauds, which is having a significant impact on the banking institutions, corporations that issue credit cards, and finally, the vendors and merchants. Consequently, there is an urgent need to implement and establish proper mechanisms that can secure the integrity of online card transactions. The research presented in this paper proposes a hybrid machine learning and swarm metaheuristic approach to address the challenge of credit card fraud detection. The novel, enhanced firefly algorithm, named group search firefly algorithm, was devised and then used to a tune support vector machine, an extreme learning machine, and extreme gradient-boosting machine learning models. Boosted models were tested on the real-world credit card fraud detection dataset, gathered from the transactions of the European credit card users. The original dataset is highly imbalanced; to further analyze the performance of tuned machine learning models, in the second experiment performed for the purpose of this research, the dataset has been expanded by utilizing the synthetic minority over-sampling approach. The performance of the proposed group search firefly metaheuristic was compared with other recent state-of-the-art approaches. Standard machine learning performance indicators have been used for the evaluation, such as the accuracy of the classifier, recall, precision, and area under the curve. The experimental findings clearly demonstrate that the models tuned by the proposed algorithm obtained superior results in comparison to other models hybridized with competitor metaheuristics. [ABSTRACT FROM AUTHOR]

Hybridized algorithms are commonly employed to improve the performance of any existing method. However, an optimal learning algorithm composed of evolutionary and swarm intelligence can radically improve the quality of the final neuron states and has not received creative attention yet. Considering this issue, this paper presents a novel metaheuristics algorithm combined with several objectives—introduced as the Hybrid Election Algorithm (HEA)—with great results in solving optimization and combinatorial problems over a binary search space. The core and underpinning ideas of this proposed HEA are inspired by socio-political phenomena, consisting of creative and powerful mechanisms to achieve the optimal result. A non-systematic logical structure can find a better phenomenon in the study of logic programming. In this regard, a non-systematic structure known as Random k Satisfiability (RANkSAT) with higher-order is hosted here to overcome the interpretability and dissimilarity compared to a systematic, logical structure in a Discrete Hopfield Neural Network (DHNN). The novelty of this study is to introduce a new multi-objective Hybrid Election Algorithm that achieves the highest fitness value and can boost the storage capacity of DHNN along with a diversified logical structure embedded with RANkSAT representation. To attain such goals, the proposed algorithm tested four different types of algorithms, such as evolutionary types (Genetic Algorithm (GA)), swarm intelligence types (Artificial Bee Colony algorithm), population-based (traditional Election Algorithm (EA)) and the Exhaustive Search (ES) model. To check the performance of the proposed HEA model, several performance metrics, such as training–testing, energy, similarity analysis and statistical analysis, such as the Friedman test with convergence analysis, have been examined and analyzed. Based on the experimental and statistical results, the proposed HEA model outperformed all the mentioned four models in this research. [ABSTRACT FROM AUTHOR]

In recent years, the vigorous rise in computational intelligence has opened up new research ideas for solving chemical dynamic optimization problems, making the application of swarm-intelligence optimization techniques more and more widespread. However, the potential for algorithms with different performances still needs to be further investigated in this context. On this premise, this paper puts forward a universal swarm-intelligence dynamic optimization framework, which transforms the infinite-dimensional dynamic optimization problem into the finite-dimensional nonlinear programming problem through control variable parameterization. In order to improve the efficiency and accuracy of dynamic optimization, an improved version of the multi-strategy enhanced sparrow search algorithm is proposed from the application side, including good-point set initialization, hybrid algorithm strategy, Lévy flight mechanism, and Student's t-distribution model. The resulting augmented algorithm is theoretically tested on ten benchmark functions, and compared with the whale optimization algorithm, marine predators algorithm, harris hawks optimization, social group optimization, and the basic sparrow search algorithm, statistical results verify that the improved algorithm has advantages in most tests. Finally, the six algorithms are further applied to three typical dynamic optimization problems under a universal swarm-intelligence dynamic optimization framework. The proposed algorithm achieves optimal results and has higher accuracy than methods in other references. [ABSTRACT FROM AUTHOR]

Swarm intelligence-based metaheuristic algorithms have attracted the attention of the research community and have been exploited for effectively solving different optimization problems of engineering, science, and technology. This paper considers the parameter estimation of the control autoregressive (CAR) model by applying a novel swarm intelligence-based optimization algorithm called the Aquila optimizer (AO). The parameter tuning of AO is performed statistically on different generations and population sizes. The performance of the AO is investigated statistically in various noise levels for the parameters with the best tuning. The robustness and reliability of the AO are carefully examined under various scenarios for CAR identification. The experimental results indicate that the AO is accurate, convergent, and robust for parameter estimation of CAR systems. The comparison of the AO heuristics with recent state of the art counterparts through nonparametric statistical tests established the efficacy of the proposed scheme for CAR estimation. [ABSTRACT FROM AUTHOR]

The modern technology universities have the necessary resource and material base for developing and transferring R&D products. However, the cost estimation process is not formalized. There are many methods of estimating the cost of R&D products' commercialization processes. However, in some cases, we cannot consider any single technique to be the best one as each of them has advantages and disadvantages. In such conditions, all efforts should be made to use a combination of the estimation techniques to arrive at a better cost and quality estimate. The effectiveness of the valuation of R&D products is of particular importance in today's economy and due to the need to analyze large data sets prepared for transfer from universities to the business environment. This paper presents the model, two methods, and general information technology for R&D products' readiness level assessment and R&D products' cost estimation. The article presents the complex method for determining the cost of R&D products, which will allow: increasing the efficiency of the transfer, commercialization, and market launch of R&D products, and promoting the interaction of all components of the national innovation infrastructure, innovations, etc. The need to consider many different indicators when evaluating R&D products has determined the need to use machine learning algorithms. We have designed a new machine learning-based model for the readiness assessment of R&D products, which is based on the principle of "crowd wisdom" and uses a stacking strategy to integrate machine learning methods. It is experimentally established that the new stacking model based on machine learning algorithms that use random forest as a meta-algorithm provides a minimum of a 1.03 times higher RMSE compared to other ensemble strategies. [ABSTRACT FROM AUTHOR]

Brain storm optimization algorithm (BSO) is a popular swarm intelligence algorithm. A significant part of BSO is to divide the population into different clusters with the clustering strategy, and the blind disturbance operator is used to generate offspring. However, this mechanism is easy to lead to premature convergence due to lacking effective direction information. In this paper, an enhanced BSO algorithm based on modified Nelder–Mead and elite learning mechanism (BSONME) is proposed to improve the performance of BSO. In the proposed BSONEM algorithm, the modified Nelder–Mead method is used to explore the effective evolutionary direction. The elite learning mechanism is used to guide the population to exploit the promising region, and the reinitialization strategy is used to alleviate the population stagnation caused by individual homogenization. CEC2014 benchmark problems and two engineering management prediction problems are used to assess the performance of the proposed BSONEM algorithm. Experimental results and statistical analyses show that the proposed BSONEM algorithm is competitive compared with several popular improved BSO algorithms. [ABSTRACT FROM AUTHOR]

Although particle swarm optimization (PSO) has been successfully applied to solve optimization problems, its optimization performance still encounters challenges when dealing with complicated optimization problems, especially those with many interacting variables and many wide and flat local basins. To alleviate this issue, this paper proposes a differential elite learning particle swarm optimization (DELPSO) by differentiating the two guiding exemplars as much as possible to direct the update of each particle. Specifically, in this optimizer, particles in the current swarm are divided into two groups, namely the elite group and non-elite group, based on their fitness. Then, particles in the non-elite group are updated by learning from those in the elite group, while particles in the elite group are not updated and directly enter the next generation. To comprise fast convergence and high diversity at the particle level, we let each particle in the non-elite group learn from two differential elites in the elite group. In this way, the learning effectiveness and the learning diversity of particles is expectedly improved to a large extent. To alleviate the sensitivity of the proposed DELPSO to the newly introduced parameters, dynamic adjustment strategies for parameters were further designed. With the above two main components, the proposed DELPSO is expected to compromise the search intensification and diversification well to explore and exploit the solution space properly to obtain promising performance. Extensive experiments conducted on the widely used CEC 2017 benchmark set with three different dimension sizes demonstrated that the proposed DELPSO achieves highly competitive or even much better performance than state-of-the-art PSO variants. [ABSTRACT FROM AUTHOR]

In this paper, we propose a family of indistinguishability operators, that we have called Yager Possibilitic Response Functions (YPRFs for short), as an appropriate tool for allocating tasks to a collective of agents. In order to select the best agent to carry out each task, we have used the so-called response threshold method, where each agent decides the next task to perform following a probabilistic Markov process and, in addition, involves a response function which models how appropriate the task is for the agent. In previous works, we developed a new response threshold method which incorporates the use of indistinguishability operators as response functions and possibility theory instead of probability, for task allocation from a very general perspective without taking into account the specific characteristics of the agents except their limitations to carry out a task. Such an allocation is modelled by means of possibilistic, instead of probabilisitic, Markov chains. We show that possibilistic Markov chains outperform its probabilistic counterparts for the aforementioned propose. All the indistinguishability operators considered in previous papers were not able to take into account the agents' restrictions for moving from a task to another one, or equivalently to carry out a task instead of another one. In order to avoid this handicap, we introduce a new kind of response functions, YPRFs, which are modelled by means of indistinguishability operators obtained via Yager t-norms. This new type of response functions drops to zero when an agent, due to its limitations, is not able to execute a task and, therefore, is able to model a generic multi-agent system with restrictions. The performed simulation, under Matlab, allows us to compare the results obtained using the new YPRFs with those obtained applying celebrated response functions also generated via indistinguishability operators (that we call Original Possibilitic Response Functions, OPRFs for short). Moreover, the results confirm that the YPRFs are able to take into account agent's restrictions while the OPRFs are not able. Finally, in the light of the experimental results, we can confirm that those systems modelled. [ABSTRACT FROM AUTHOR]

The particle swarm optimization algorithm (PSO) is not good at dealing with discrete optimization problems, and for the krill herd algorithm (KH), the ability of local search is relatively poor. In this paper, we optimized PSO by quantum behavior and optimized KH by simulated annealing, so a new hybrid algorithm, named the annealing krill quantum particle swarm optimization (AKQPSO) algorithm, is proposed, and is based on the annealing krill herd algorithm (AKH) and quantum particle swarm optimization algorithm (QPSO). QPSO has better performance in exploitation and AKH has better performance in exploration, so AKQPSO proposed on this basis increases the diversity of population individuals, and shows better performance in both exploitation and exploration. In addition, the quantum behavior increased the diversity of the population, and the simulated annealing strategy made the algorithm avoid falling into the local optimal value, which made the algorithm obtain better performance. The test set used in this paper is a classic 100-Digit Challenge problem, which was proposed at 2019 IEEE Congress on Evolutionary Computation (CEC 2019), and AKQPSO has achieved better performance on benchmark problems. [ABSTRACT FROM AUTHOR]

The paper introduces a new approach to enhance optimization algorithms when solving the piecewise linearization problem of a given function. Eight swarm intelligence algorithms were selected to be experimentally compared. The problem is represented by the calculation of the distance between the original function and the estimation from the piecewise linear function. Here, the piecewise linearization of 2D functions is studied. Each of the employed swarm intelligence algorithms is enhanced by a newly proposed automatic detection of the number of piecewise linear parts that determine the discretization points to calculate the distance between the original and piecewise linear function. The original algorithms and their enhanced variants are compared on several examples of piecewise linearization problems. The results show that the enhanced approach performs sufficiently better when it creates a very promising approximation of functions. Moreover, the degree of precision is slightly decreased by the focus on the speed of the optimization process. [ABSTRACT FROM AUTHOR]

This paper proposes a novel variant of the Grey Wolf Optimization (GWO) algorithm, named Velocity-Aided Grey Wolf Optimizer (VAGWO). The original GWO lacks a velocity term in its position-updating procedure, and this is the main factor weakening the exploration capability of this algorithm. In VAGWO, this term is carefully set and incorporated into the updating formula of the GWO. Furthermore, both the exploration and exploitation capabilities of the GWO are enhanced in VAGWO via stressing the enlargement of steps that each leading wolf takes towards the others in the early iterations while stressing the reduction in these steps when approaching the later iterations. The VAGWO is compared with a set of popular and newly proposed meta-heuristic optimization algorithms through its implementation on a set of 13 high-dimensional shifted standard benchmark functions as well as 10 complex composition functions derived from the CEC2017 test suite and three engineering problems. The complexity of the proposed algorithm is also evaluated against the original GWO. The results indicate that the VAGWO is a computationally efficient algorithm, generating highly accurate results when employed to optimize high-dimensional and complex problems. [ABSTRACT FROM AUTHOR]

This paper introduces a strategy to enrich swarm intelligence algorithms with the preferences of the Decision Maker (DM) represented in an ordinal classifier based on interval outranking. Ordinal classification is used to bias the search toward the Region of Interest (RoI), the privileged zone of the Pareto frontier containing the most satisfactory solutions according to the DM's preferences. We applied this hybridising strategy to two swarm intelligence algorithms, i.e., Multi-objective Grey Wolf Optimisation and Indicator-based Multi-objective Ant Colony Optimisation for continuous domains. The resulting hybrid algorithms were called GWO-InClass and ACO-InClass. To validate our strategy, we conducted experiments on the DTLZ problems, the most widely studied test suit in the framework of multi-objective optimisation. According to the results, our approach is suitable when many objective functions are treated. GWO-InClass and ACO-InClass demonstrated the capacity of reaching the RoI better than the original metaheuristics that approximate the complete Pareto frontier. [ABSTRACT FROM AUTHOR]

The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA. [ABSTRACT FROM AUTHOR]

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems. [ABSTRACT FROM AUTHOR]

At present, iris recognition has been widely used as a biometrics-based security enhancement technology. However, in some application scenarios where a long-distance camera is used, due to the limitations of equipment and environment, the collected iris images cannot achieve the ideal image quality for recognition. To solve this problem, we proposed a modified sparrow search algorithm (SSA) called chaotic pareto sparrow search algorithm (CPSSA) in this paper. First, fractional-order chaos is introduced to enhance the diversity of the population of sparrows. Second, we introduce the Pareto distribution to modify the positions of finders and scroungers in the SSA. These can not only ensure global convergence, but also effectively avoid the local optimum issue. Third, based on the traditional contrast limited adaptive histogram equalization (CLAHE) method, CPSSA is used to find the best clipping limit value to limit the contrast. The standard deviation, edge content, and entropy are introduced into the fitness function to evaluate the enhancement effect of the iris image. The clipping values vary with the pictures, which can produce a better enhancement effect. The simulation results based on the 12 benchmark functions show that the proposed CPSSA is superior to the traditional SSA, particle swarm optimization algorithm (PSO), and artificial bee colony algorithm (ABC). Finally, CPSSA is applied to enhance the long-distance iris images to demonstrate its robustness. Experiment results show that CPSSA is more efficient for practical engineering applications. It can significantly improve the image contrast, enrich the image details, and improve the accuracy of iris recognition. [ABSTRACT FROM AUTHOR]

Swarm intelligence techniques have been created to respond to theoretical and practical global optimization problems. This paper puts forward an enhanced version of the firefly algorithm that corrects the acknowledged drawbacks of the original method, by an explicit exploration mechanism and a chaotic local search strategy. The resulting augmented approach was theoretically tested on two sets of bound-constrained benchmark functions from the CEC suites and practically validated for automatically selecting the optimal dropout rate for the regularization of deep neural networks. Despite their successful applications in a wide spectrum of different fields, one important problem that deep learning algorithms face is overfitting. The traditional way of preventing overfitting is to apply regularization; the first option in this sense is the choice of an adequate value for the dropout parameter. In order to demonstrate its ability in finding an optimal dropout rate, the boosted version of the firefly algorithm has been validated for the deep learning subfield of convolutional neural networks, with respect to five standard benchmark datasets for image processing: MNIST, Fashion-MNIST, Semeion, USPS and CIFAR-10. The performance of the proposed approach in both types of experiments was compared with other recent state-of-the-art methods. To prove that there are significant improvements in results, statistical tests were conducted. Based on the experimental data, it can be concluded that the proposed algorithm clearly outperforms other approaches. [ABSTRACT FROM AUTHOR]

Software defect prediction (SDP) is crucial in the early stages of defect-free software development before testing operations take place. Effective SDP can help test managers locate defects and defect-prone software modules. This facilitates the allocation of limited software quality assurance resources optimally and economically. Feature selection (FS) is a complicated problem with a polynomial time complexity. For a dataset with N features, the complete search space has 2 N feature subsets, which means that the algorithm needs an exponential running time to traverse all these feature subsets. Swarm intelligence algorithms have shown impressive performance in mitigating the FS problem and reducing the running time. The moth flame optimization (MFO) algorithm is a well-known swarm intelligence algorithm that has been used widely and proven its capability in solving various optimization problems. An efficient binary variant of MFO (BMFO) is proposed in this paper by using the island BMFO (IsBMFO) model. IsBMFO divides the solutions in the population into a set of sub-populations named islands. Each island is treated independently using a variant of BMFO. To increase the diversification capability of the algorithm, a migration step is performed after a specific number of iterations to exchange the solutions between islands. Twenty-one public software datasets are used for evaluating the proposed method. The results of the experiments show that FS using IsBMFO improves the classification results. IsBMFO followed by support vector machine (SVM) classification is the best model for the SDP problem over other compared models, with an average G-mean of 78%. [ABSTRACT FROM AUTHOR]

Bio-inspired computing is an engaging area of artificial intelligence which studies how natural phenomena provide a rich source of inspiration in the design of smart procedures able to become powerful algorithms. Many of these procedures have been successfully used in classification, prediction, and optimization problems. Swarm intelligence methods are a kind of bio-inspired algorithm that have been shown to be impressive optimization solvers for a long time. However, for these algorithms to reach their maximum performance, the proper setting of the initial parameters by an expert user is required. This task is extremely comprehensive and it must be done in a previous phase of the search process. Different online methods have been developed to support swarm intelligence techniques, however, this issue remains an open challenge. In this paper, we propose a hybrid approach that allows adjusting the parameters based on a state deducted by the swarm intelligence algorithm. The state deduction is determined by the classification of a chain of observations using the hidden Markov model. The results show that our proposal exhibits good performance compared to the original version. [ABSTRACT FROM AUTHOR]

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Swarm intelligence has appeared as an active field for solving numerous machine-learning tasks. In this paper, we address the problem of clustering data with missing values, where the patterns are described by mixed (or hybrid) features. We introduce a generic modification to three swarm intelligence algorithms (Artificial Bee Colony, Firefly Algorithm, and Novel Bat Algorithm). We experimentally obtain the adequate values of the parameters for these three modified algorithms, with the purpose of applying them in the clustering task. We also provide an unbiased comparison among several metaheuristics based clustering algorithms, concluding that the clusters obtained by our proposals are highly representative of the "natural structure" of data. [ABSTRACT FROM AUTHOR]

In this paper, we integrate the autonomous search paradigm on a swarm intelligence algorithm in order to incorporate the auto-adjust capability on parameter values during the run. We propose an independent procedure that begins to work when it detects a stagnation in a local optimum, and it can be applied to any population-based algorithms. For that, we employ the autonomous search technique which allows solvers to automatically re-configure its solving parameters for enhancing the process when poor performances are detected. This feature is dramatically crucial when swarm intelligence methods are developed and tested. Finding the best parameter values that generate the best results is known as an optimization problem itself. For that, we evaluate the behavior of the population size to autonomously be adapted and controlled during the solving time according to the requirements of the problem. The proposal is testing on the dolphin echolocation algorithm which is a recent swarm intelligence algorithm based on the dolphin feature to navigate underwater and identify prey. As an optimization problem to solve, we test a machine-part cell formation problem which is a widely used technique for improving production flexibility, efficiency, and cost reduction in the manufacturing industry decomposing a manufacturing plant in a set of clusters called cells. The goal is to design a cell layout in such a way that the need for moving parts from one cell to another is minimized. Using statistical non-parametric tests, we demonstrate that the proposed approach efficiently solves 160 well-known cell manufacturing instances outperforming the classic optimization algorithm as well as other approaches reported in the literature, while keeping excellent robustness levels. [ABSTRACT FROM AUTHOR]

Convolutional neural networks have a broad spectrum of practical applications in computer vision. Currently, much of the data come from images, and it is crucial to have an efficient technique for processing these large amounts of data. Convolutional neural networks have proven to be very successful in tackling image processing tasks. However, the design of a network structure for a given problem entails a fine-tuning of the hyperparameters in order to achieve better accuracy. This process takes much time and requires effort and expertise from the domain. Designing convolutional neural networks' architecture represents a typical NP-hard optimization problem, and some frameworks for generating network structures for a specific image classification tasks have been proposed. To address this issue, in this paper, we propose the hybridized monarch butterfly optimization algorithm. Based on the observed deficiencies of the original monarch butterfly optimization approach, we performed hybridization with two other state-of-the-art swarm intelligence algorithms. The proposed hybrid algorithm was firstly tested on a set of standard unconstrained benchmark instances, and later on, it was adapted for a convolutional neural network design problem. Comparative analysis with other state-of-the-art methods and algorithms, as well as with the original monarch butterfly optimization implementation was performed for both groups of simulations. Experimental results proved that our proposed method managed to obtain higher classification accuracy than other approaches, the results of which were published in the modern computer science literature. [ABSTRACT FROM AUTHOR]

The correct design of a Wireless Sensor Network (WSN) is a very important task because it can highly influence its installation and operational costs. An important aspect that should be addressed with WSN is the routing definition in multi-hop networks. This problem is faced with different methods in the literature, and here it is managed with a recently developed swarm intelligence algorithm called Social Network Optimization (SNO). In this paper, the routing definition in WSN is approached with two different problem codifications and solved with SNO and Particle Swarm Optimization. The first codification allows the optimization algorithm more degrees of freedom, resulting in a slower and in many cases sub-optimal solution. The second codification reduces the degrees of freedom, speeding significantly the optimization process and blocking in some cases the convergence toward the real best network configuration. [ABSTRACT FROM AUTHOR]

Inspired by the behavior of elephants in nature, elephant herd optimization (EHO) was proposed recently for global optimization. Like most other metaheuristic algorithms, EHO does not use the previous individuals in the later updating process. If the useful information in the previous individuals were fully exploited and used in the later optimization process, the quality of solutions may be improved significantly. In this paper, we propose several new updating strategies for EHO, in which one, two, or three individuals are selected from the previous iterations, and their useful information is incorporated into the updating process. Accordingly, the final individual at this iteration is generated according to the elephant generated by the basic EHO, and the selected previous elephants through a weighted sum. The weights are determined by a random number and the fitness of the elephant individuals at the previous iteration. We incorporated each of the six individual updating strategies individually into the basic EHO, creating six improved variants of EHO. We benchmarked these proposed methods using sixteen test functions. Our experimental results demonstrated that the proposed improved methods significantly outperformed the basic EHO. [ABSTRACT FROM AUTHOR]