Search

Artificial rabbits optimization (ARO) is a swarm intelligence-based algorithm inspired by the survival strategies of rabbits. Although ARO has a good convergence rate, it is prone to get stuck in the local optima and converge prematurely. To overcome this, the present paper redesigns the exploration operator of the ARO algorithm with the roulette fitness-distance balance (RFDB) and dynamic fitness-distance balance (d FDB) strategies. In this context, three different versions of the fitness-distance balance-based artificial rabbits optimization (FDBARO) algorithm are developed. The performance of the original ARO and FDBARO versions (FDBARO-1, FDBARO-2, and FDBARO-3) are evaluated on CEC 2017 and CEC 2020 benchmark functions. The obtained results are analyzed with the Wilcoxon and Friedman statistical tests. Statistical and convergence analysis results showed that the FDBARO-3 algorithm designed with the d FDB selection method can explore the search space more successfully compared to other algorithms. This version was named the dynamic FDBARO (d FDBARO) algorithm. Moreover, the practicability of the proposed d FDBARO is highlighted by the solution of the optimal power flow (OPF) problem formulated with renewable energy sources (RESs) and flexible alternating current transmission system (FACTS) devices considering fixed and uncertain load demands. Experimental results showed that the proposed d FDBARO is a competitive algorithm for solving global optimization and constrained OPF problems. The source code of the d FDBARO algorithm is available at https://www.mathworks.com/matlabcentral/fileexchange/154845-dfdbaro-an-enhanced-metaheuristic-algorithm. [ABSTRACT FROM AUTHOR]

Abstract: Particle swarm optimization (PSO) is one of the most important research topics on swarm intelligence. Existing PSO techniques, however, still contain some significant disadvantages. In this paper, we present a new QBL-PSO algorithm that uses QBL (query-based learning) to improve both the exploratory and exploitable capabilities of PSO. Here, we apply a QBL method proposed in our previous research to PSO, and then test this new algorithm on a real case study on problems of power conservation. Our algorithm not only broadens the search diversity of PSO, but also improves its precision. Conventional PSO often snag on local solutions when performing queries, instead of finding better global solutions. To resolve this limitation, when particles converge in nature, we direct some of them into an “ambiguous solution space” defined by our algorithm. This paper introduces two ways to invoke this QBL algorithm. Our experimental results confirm that the proposed method attains better convergence to the global best solution. Finally, we present a new PSO model for solving multi-objective power conservation problems. Overall, this model successfully reduces power consumption, and to our knowledge, this paper represents the first attempt within the literature to apply the QBL concept to PSO. [Copyright &y& Elsevier]

Abstract: This paper proposes a self-generating fuzzy system with a learning ability from a combination of the on-line self-aligning clustering (OSAC) algorithm and ant and particle swarm cooperative optimization (APSCO). The proposed OSAC algorithm not only helps generate rules from on-line training data, but also helps avoid generating highly overlapping fuzzy sets. Once a new rule is generated, APSCO optimizes the corresponding antecedent and consequent parameters. In APSCO, ant colony and particle swarm coexist in a population, and both search for an optimal parameter solution simultaneously in each iteration. Ant paths not only help determine the consequent parameters of generated rules, they also help generate auxiliary particles. Well-performing particles are selected from the auxiliary particles and original particles. And these selected particles cooperate to find a better solution through particle swarm optimization. This paper applies the proposed self-generating fuzzy system to different fuzzy controller design problems, and compares it with other genetic and swarm intelligence algorithms and their hybrids to verify system performance. [Copyright &y& Elsevier]

Driver pathways have been acknowledged to play critical roles in the initiation and progression of cancers►hence it is essential for precision medicine related studies to develop accurate and efficient methods to identify them. Although previous approaches have shown promising results by integrating multi-omics data, their preset artificial parameters may decrease the convenience to use and limit the application scalability. In this paper, a novel integration approach is proposed to incorporate four omics data, i.e., construct a weighted non-binary mutation matrix without presetting artificial parameters. A parameter-free identification model is put forward based on it. It takes advantage of the association between genes in the PPI network as well as balances the contribution of coverage and mutual exclusivity with the harmonic mean. Furthermore, a cooperative co-evolution algorithm is proposed for solving this model. In the algorithm, a particle swarm optimization algorithm suitable for solving combinatorial problems is presented. Three cooperative operators are devised to construct the cooperation among the populations and the swarm to increase the population diversity. Both real biological datasets and simulated ones were exerted to perform experimental comparisons among the proposed method and six other state-of-the-art ones. The gene sets identified by the presented method generally contain more genes involved in known signaling pathways than those obtained by the other methods. Simultaneously, both high accuracy and high efficiency of the proposed method were verified in experiments, making it practical in realistic applications and an effective supplementary tool to identify driver pathways. • A non-binary mutation matrix is constructed without artificial adjustable parameters. • The model incorporates gene association and balances coverage and mutual exclusivity. • A PSO algorithm suitable for solving combinatorial problems is presented. • A co-operative co-evolution algorithm is put forward for solving the presented model. • The performance is compared among the proposed method and seven state of the art ones. [ABSTRACT FROM AUTHOR]

Target searching with autonomous robots require an efficient target search method that considers their constraints and environmental characteristics. Particle swarm optimization (PSO) is a fantastic population-based optimization algorithm. It is often used in swarm robotics cooperative search jobs because of its inspiration resources and velocity updating function. Given the global optimization features of PSO, it is simple to converge on a particular location in a search environment and miss out on opportunities to learn more. This paper proposes an adaptive exploration robotic PSO (AERPSO) to solve multi-target search problems. The proposed method enhances the chances of exploring unexplored regions and helps with obstacle avoidance using evolutionary speed and aggregation degree. The adaptive inertia weight helps in enhanced exploration. The simulation results compiled from various simulation experiments show that AERPSO performs way ahead of the existing state-of-the-art techniques for target searching. The proposed algorithm improves the search time by approximately 40% and the detection rate by 25% in comparison with existing approaches. It balances exploration and exploitation to become an excellent approach for multi-target searching. • To propose an adaptive exploration robotic PSO to search multiple targets. • The method avoids local minima and keeps the diversity among the population. • It enhances the exploration by adapting the inertia weights. • The proposed algorithm deals with overshooting problem of PSO. [ABSTRACT FROM AUTHOR]

Abstract: This paper considers simultaneous optimization of strategic design and distribution decisions for three-echelon supply chain architecture consisting of following three players; suppliers, production plants, and distribution centers (DCs). The key design decisions considered are: the number and location of plants in the system, the flow of raw materials from suppliers to plants, the quantity of products to be shipped from plants to distribution centers, so as to minimize the combined facility location, production, inventory, and shipment costs and maximize fill rate. To achieve this, three-echelon network model is mathematically represented and solved using swarm intelligence based Multi-objective Hybrid Particle Swarm Optimization algorithm (MOHPSO). This heuristic incorporates non-dominated sorting (NDS) procedure to achieve bi-objective optimization of two conflicting objectives. The applicability of proposed optimization algorithm was then tested by applying it to standard test problems found in literature. On achieving comparable results, the approach was applied to actual data of a pump manufacturing industry. The results show that the proposed solution approach performs efficiently. [Copyright &y& Elsevier]

Abstract: In this paper, comparative performance analysis of various binary coded PSO algorithms on optimal PI and PID controller design for multiple inputs multiple outputs (MIMO) process is stated. Four algorithms such as modified particle swarm optimization (MPSO), discrete binary PSO (DBPSO), modified discrete binary PSO (MBPSO) and probability based binary PSO (PBPSO) are independently realized using MATLAB. The MIMO process of binary distillation column plant, described by Wood and Berry, with and without a decoupler having two inputs and two outputs is considered. Simulations are carried out to minimize two objective functions, that is, time integral of absolute error (ITAE) and integral of absolute error (IAE) with single stopping criterion for each algorithm called maximum number of fitness evaluations. The simulation experiments are repeated 20 times with each algorithm in each case. The performance measures for comparison of various algorithms such as mean fitness, variance of fitness, and best fitness are computed. The transient performance indicators and computation time are also recorded. The inferences are made based on analysis of statistical data obtained from 20 trials of each algorithm and after having comparison with some recently reported results about same MIMO controller design employing real coded genetic algorithm (RGA) with SBX and multi-crossover approaches, covariance matrix adaptation evolution strategy (CMAES), differential evolution (DE), modified continuous PSO (MPSO) and biggest log modulus tuning (BLT). On the basis of simulation results PBPSO is identified as a comparatively better method in terms of its simplicity, consistency, search and computational efficiency. [Copyright &y& Elsevier]

Abstract: The bacterial foraging optimization (BFO) algorithm is a popular stochastic, population-based optimization technique that can be applied to a wide range of problems. Two are the major issues the BFO algorithm is confronted with: first, the foraging mechanism of BFO might in some cases induce the attraction of bacteria gathered near the global optimum by bacteria gathered to local optima, thus slowing down the whole population convergence. Second, BFO is susceptible to the curse-of-dimensionality, which makes it significantly harder to find the global optimum of a high-dimensional problem, compared to a low-dimensional problem with similar topology. In this paper, we introduce a novel BFO-based optimization algorithm aiming to address these issues, the synergetic bacterial swarming optimization (SBSO) algorithm. Our novel approach consists of: (i) the introduction of the swarming dynamics of the particle swarm optimization algorithm in the context of BFO, in order to ameliorate the convergence issues of the BFO bacteria foraging mechanism; and (ii) the utilization of multiple populations to optimize different components of the solution vector cooperatively, so as to mitigate the curse-of-dimensionality issues of the algorithm. We demonstrate the efficacy of our approach on several benchmark optimization problems. [Copyright &y& Elsevier]

Abstract: This paper presents a new multi-objective optimization algorithm in which multi-swarm cooperative strategy is incorporated into particle swarm optimization algorithm, called multi-swarm cooperative multi-objective particle swarm optimizer (MC-MOPSO). This algorithm consists of multiple slave swarms and one master swarm. Each slave swarm is designed to optimize one objective function of the multi-objective problem in order to find out all the non-dominated optima of this objective function. In order to produce a well distributed Pareto front, the master swarm is developed to cover gaps among non-dominated optima by using a local MOPSO algorithm. Moreover, in order to strengthen the capability locating multiple optima of the PSO, several improved techniques such as the Pareto dominance-based species technique and the escape strategy of mature species are introduced. The simulation results indicate that our algorithm is highly competitive to solving the multi-objective optimization problems. [Copyright &y& Elsevier]

Abstract: This paper presents a real-value version of particle swarm optimization (PSO) for solving the open vehicle routing problem (OVRP) that is a well-known combinatorial optimization problem. In OVRP a vehicle does not return to the depot after servicing the last customer on a route. A particular decoding method is proposed for implementing PSO for OVRP. In the decoding method, a vector of the customer’s position is constructed in descending order. Then each customer is assigned to a route with taking into account feasibility conditions. Finally one-point move has been applied on constructed routes that seem promising to result in a better solution. Experimental evaluations on benchmark data sets demonstrate the competitiveness of the proposed algorithm. [Copyright &y& Elsevier]

Abstract: Particle swarm optimization (PSO) is a population-based swarm intelligence algorithm that shares many similarities with evolutionary computation techniques. However, the PSO is driven by the simulation of a social psychological metaphor motivated by collective behaviors of bird and other social organisms instead of the survival of the fittest individual. Inspired by the classical PSO method and quantum mechanics theories, this work presents novel quantum-behaved PSO (QPSO) approaches using mutation operator with Gaussian probability distribution. The application of Gaussian mutation operator instead of random sequences in QPSO is a powerful strategy to improve the QPSO performance in preventing premature convergence to local optima. In this paper, new combinations of QPSO and Gaussian probability distribution are employed in well-studied continuous optimization problems of engineering design. Two case studies are described and evaluated in this work. Our results indicate that Gaussian QPSO approaches handle such problems efficiently in terms of precision and convergence and, in most cases, they outperform the results presented in the literature. [Copyright &y& Elsevier]

Recent advances in metaheuristics have shown the advantages of using the Lévy distribution, which models a kind of random walk (named "Lévy flight") with occasional "big" steps. This characteristic makes Lévy flight especially useful for performing large "jumps" that allow the search to escape from a local optimum and restart in a different region of the search space. In this paper, we investigate this idea by applying Lévy flight to Jaya, a simple yet effective Swarm Intelligence optimization algorithm recently proposed in the literature. We perform experiments on the CEC 2014 benchmark as well as five industrial optimization problems taken from the CEC 2011 benchmark, and compare the performance of the proposed Lévy flight Jaya Algorithm (LJA) against several state-of-the-art algorithms for continuous optimization. Our numerical results show that, although both Jaya and LJA are in general less efficient than the most advanced algorithms on the CEC 2014 benchmark, LJA largely outperforms the original Jaya algorithm in most cases, and is also highly competitive on the tested industrial problems. • We present the Lévy flight Jaya Algorithm (LJA) for continuous optimization. • We evaluate the effect of the β parameter on LJA. • LJA consistently outperforms the original Jaya on most optimization problems. • We compare LJA with state-of-the-art algorithms on benchmark/industrial problems. [ABSTRACT FROM AUTHOR]

• Propose a novel FS method, called ISSAFD, which improves Salp Swarm Algorithm (SSA). • ISSAFS enhanced the followers in SSA using SCA and Disrupt operator (DO). • Evaluating the influence of the operators of SCA on the behavior of leaders in SSA. • Comparing the performance of ISSAFD with swarm intelligence (SI). • The proposed ISSAFD provided better results in terms of performance measures. Features Selection (FS) plays an important role in enhancing the performance of machine learning techniques in terms of accuracy and response time. As FS is known to be an NP-hard problem, the aim of this paper is to introduce basically a new variant of Salp Swarm Optimizer (SSA) for FS (called ISSAFD (Improved Followers of Salp swarm Algorithm using Sine Cosine algorithm and Disrupt Operator), that updates the position of followers (F) in SSA using sinusoidal mathematical functions that were inspired from the Sine Cosine Algorithm (SCA). This enhancement helps to improve the exploration phase and to avoid stagnation in a local area. Moreover, the Disruption Operator (D op) is applied for all solutions, in order to enhance the population diversity and to maintain the balance between exploration and exploitation processes. Two other variants of SSA are developed based on SCA called ISSALD (Improved Leaders of Salp swarm Algorithm using Sine Cosine algorithm and Disrupt Operator) and ISSAF (Improved Followers of Salp swarm Algorithm using Sine Cosine algorithm). The updating process in consists to update the leaders (L) position by SCA and applying (D op), whereas in ISSAF, the D op is omitted and the position of followers is updated by SCA. Experimental results are evaluated on twenty datasets where four of them represent high dimensionality with a small number of instances. The obtained results show a good performance of ISSAFD in terms of accuracy, sensitivity, specificity, and the number of selected features in comparison with other metaheuristics (MH). [ABSTRACT FROM AUTHOR]

• Hybrid distributed SI - NM algorithms is investigated for DOA estimation in WSN. • Distributed MEGWO-NM Algorithm reduces communication overhead and computation time. • Combiner coefficients based on degree of sensor node is proposed. • Distributed CRLB is derived to compare the performance of hybrid algorithms. Distributed direction of arrival (DOA) estimation based on maximum likelihood (ML) is an energy-efficient source localization technique that is vital to systems such as wireless sensor networks (WSN). Due to the multimodal nature of the ML function, the distributed approach uses swarm intelligence (SI) algorithms. However, this approach has slow convergence and incurs significant communication overhead for more than two sources. Hence, to obtain accurate DOA estimates with faster convergence, this paper proposes a distributed hybrid version of SI and Nelder-Mead (NM) simplex algorithm. In this approach, a modified evolutionary population dynamics based distributed Grey Wolf optimization SI algorithm is proposed to obtain initial DOA estimates. Then NM provides accurate DOA estimates with faster convergence and thereby reduces the communication overhead. Detailed simulation analysis shows that by using Quasi-Opposition based population initialization and sensor node degree combiner coefficients, the proposed distributed hybrid algorithm converges to theoretical Cramer-Rao lower bound with small communication overhead. Thus DOA estimation can be performed in an energy-efficient way by incorporating a computationally intelligent distributed hybrid approach. [ABSTRACT FROM AUTHOR]