Variant Of Particle Swarm Optimization Algorithm Research Articles

Population interaction network in representative gravitational search algorithms: Logistic distribution leads to worse performance

In this paper, a novel study on the way inter-individual information interacts in meta-heuristic algorithms (MHAs) is carried out using a scheme known as population interaction networks (PIN). Specifically, three representative MHAs, including the differential evolutionary algorithm (DE), the particle swarm optimization algorithm (PSO), the gravitational search algorithm (GSA), and four classical variations of the gravitational search algorithm, are analyzed in terms of inter-individual information interactions and the differences in the performance of each of the algorithms on IEEE Congress on Evolutionary Computation 2017 benchmark functions. The cumulative distribution function (CDF) of the node degree obtained by the algorithm on the benchmark function is fitted to the seven distribution models by using PIN. The results show that among the seven compared algorithms, the more powerful DE is more skewed towards the Poisson distribution, and the weaker PSO, GSA, and GSA variants are more skewed towards the Logistic distribution. The more deviation from Logistic distribution GSA variants conform, the stronger their performance. From the point of view of the CDF, deviating from the Logistic distribution facilitates the improvement of the GSA. Our findings suggest that the population interaction network is a powerful tool for characterizing and comparing the performance of different MHAs in a more comprehensive and meaningful way.

A novel particle swarm optimization algorithm with Lévy flight and orthogonal learning

• In LOPSO, the there major highlights are described below. • First, a novel PSO based on Lévy flight and orthogonal learning with enhanced exploitation ability and faster search efficiency is proposed. The jumping ability of Lévy flights is utilized to enhance the exploration, while the orthogonal learning process aims to strengthen the exploitation;. • Second, an orthogonal learning process for particle swarms is developed. In the orthogonal learning process, the inclusion of the Lévy flights term in the levels of the Taguchi method is determined based on the flight probability value. Besides, parallel computation is easier to perform during orthogonal learning, which greatly improves efficiency. • Third, each particle in the proposed LOPSO learns from the only best experience generated by a new search strategy instead of the history best experience of each particle and the global best experience that used in the classical PSO variants, thus avoiding the conflict between above two guides. Taguchi method This paper presents a novel particle swarm optimization algorithm (PSO) variant to tackle single-objective numerical optimization, named “Lévy flight orthogonal learning particle swarm optimization” (LOPSO). There are three contributions mentioned in the paper: First, a novel PSO based on Lévy flight and orthogonal learning with enhanced exploitation ability and faster search efficiency is proposed. The jumping ability of Lévy flight is utilized to enhance the exploration, while the orthogonal learning process aims to strengthen the exploitation; Second, an orthogonal learning process for particle swarms is developed. In the orthogonal learning process, the Lévy flight term's inclusion in the Taguchi method levels is determined based on the flight probability value. Besides, parallel computation is easier to perform during orthogonal learning, which greatly improves efficiency. Third, each particle in the proposed LOPSO learns from the only best experience generated by a new search strategy instead of the historical best experience of each particle and the global best experience that is used in the classical PSO variants, thus avoiding the conflict between the above two guides. A large test suite containing benchmarks from the CEC2013 and the CEC2015 test suites on real-parameter single-objective optimization is employed in the algorithm validation, and extensive experiments demonstrate that the comprehensive performance of LOPSO ranks first in terms of accuracy and Wilcoxon signed-rank test in most cases with the same population size and iteration steps and similar time consumption, when compared with the canonical PSO and 13 state-of-the-art PSO variants.

Adjustable driving force based particle swarm optimization algorithm

Particle swarm optimization algorithm (PSO) is a popular optimizer, in which each particle selects its learning exemplars relying on their fitness. Thus, the search process of each particle can be seen as driven by a fitness-based force. Intuitively, the driving force is conducive to the optimizing process. However, it may bring a premature convergence of a population. In this work, a novelty-based driving force is put forward to overcome deficiencies of the fitness-based driving force. In the new proposed adjustable driving force based PSO, named as ADFPSO, two types of exemplars respectively with high fitness and high novelty are saved in two archives. In each generation, a particle respectively chooses two exemplars from the two archives to update its velocity. In addition, three time-varying parameters are introduced to adjust the particle’s learning weights for the two exemplars aiming to satisfy distinct requirements of different evolution stages. Comprehensive properties of ADFPSO are extensively testified by a set of experiments, in which nine PSO variants are adopted as peer algorithms and two CEC test suites are selected as optimization problems. Moreover, distinct characteristics of the proposed novelty-based driving force are also analyzed based on a few experiments.

Particle Swarm Optimization Algorithm with Multiple Phases for Solving Continuous Optimization Problems

An algorithm with different parameter settings often performs differently on the same problem. The parameter settings are difficult to determine before the optimization process. The variants of particle swarm optimization (PSO) algorithms are studied as exemplars of swarm intelligence algorithms. Based on the concept of building block thesis, a PSO algorithm with multiple phases was proposed to analyze the relation between search strategies and the solved problems. Two variants of the PSO algorithm, which were termed as the PSO with fixed phase (PSOFP) algorithm and PSO with dynamic phase (PSODP) algorithm, were compared with six variants of the standard PSO algorithm in the experimental study. The benchmark functions for single-objective numerical optimization, which includes 12 functions in 50 and 100 dimensions, are used in the experimental study, respectively. The experimental results have verified the generalization ability of the proposed PSO variants.

A multi-sample particle swarm optimization algorithm based on electric field force.

Aiming at the premature convergence problem of particle swarm optimization algorithm, a multi-sample particle swarm optimization (MSPSO) algorithm based on electric field force is proposed. Firstly, we introduce the concept of the electric field into the particle swarm optimization algorithm. The particles are affected by the electric field force, which makes the particles exhibit diverse behaviors. Secondly, MSPSO constructs multiple samples through two new strategies to guide particle learning. An electric field force-based comprehensive learning strategy (EFCLS) is proposed to build attractive samples and repulsive samples, thus improving search efficiency. To further enhance the convergence accuracy of the algorithm, a segment-based weighted learning strategy (SWLS) is employed to construct a global learning sample so that the particles learn more comprehensive information. In addition, the parameters of the model are adjusted adaptively to adapt to the population status in different periods. We have verified the effectiveness of these newly proposed strategies through experiments. Sixteen benchmark functions and eight well-known particle swarm optimization algorithm variants are employed to prove the superiority of MSPSO. The comparison results show that MSPSO has better performance in terms of accuracy, especially for high-dimensional spaces, while maintaining a faster convergence rate. Besides, a real-world problem also verified that MSPSO has practical application value.

UCPSO: A Uniform Initialized Particle Swarm Optimization Algorithm with Cosine Inertia Weight

The particle swarm optimization algorithm (PSO) is a meta-heuristic algorithm with swarm intelligence. It has the advantages of easy implementation, high convergence accuracy, and fast convergence speed. However, PSO suffers from falling into a local optimum or premature convergence, and a better performance of PSO is desired. Some methods adopt improvements in PSO parameters, particle initialization, or topological structure to enhance the global search ability and performance of PSO. These methods contribute to solving the problems above. Inspired by them, this paper proposes a variant of PSO with competitive performance called UCPSO. UCPSO combines three effective improvements: a cosine inertia weight, uniform initialization, and a rank-based strategy. The cosine inertia weight is an inertia weight in the form of a variable-period cosine function. It adopts a multistage strategy to balance exploration and exploitation. Uniform initialization can prevent the aggregation of initial particles. It distributes initial particles uniformly to avoid being trapped in a local optimum. A rank-based strategy is employed to adjust an individual particle's inertia weight. It enhances the swarm's capabilities of exploration and exploitation at the same time. Comparative experiments are conducted to validate the effectiveness of the three improvements. Experiments show that the UCPSO improvements can effectively improve global search ability and performance.

Particle Swarm Optimization Based Swarm Intelligence for Active Learning Improvement: Application on Medical Data Classification

Semi-supervised learning targets the common situation where labeled data are scarce but unlabeled data are abundant. It uses unlabeled data to help supervised learning tasks. In practice, it may make sense to utilize active learning in conjunction with semi-supervised learning. That is, we might allow the learning algorithm to pick a set of unlabeled instances to be labeled by a domain expert, which will then be used as the labeled data set. However, existing approaches are computationally expensive and require searching through an entire unlabeled dataset, which may contain redundant instances that provide no instructive information to the classifier and can decrease the performance. To address this optimization problem, a hybrid system that combines active learning (AL) and particle swarm optimization (PSO) algorithms is proposed to reduce the cost of labeling while building a more efficient classifier. The novelty of this work resides in the integration of a bio-inspired optimization algorithm in the machine learning strategy. Furthermore, a novel uncertainty measure was integrated into the particle swarm optimization algorithm as an objective function to select from massive amounts of medical instances those that are deemed most informative. To evaluate the effectiveness of the proposed approach, eighteen (18) benchmark datasets were used and compared against three best-known classifiers with different learning paradigms: AL–NB an active learning algorithm using Naive Base classifier and Margin Sampling strategy, SVM (Support Vector Machine), ELM (Extreme Learning Machine) with supervised learning, and TSVM (Transductive Support Vector Machine) with the semi-supervised learning. Experiments showed that the proposed approach is effective in reducing the efforts required by experts for medical data annotation to produce an accurate classifier. The active learning approach has been utilized to optimize the expensive task of labeling. Based on a novel uncertainty measure, the nature-inspired algorithm PSO attempts to select from massive amounts of unlabeled medical instances those considered informative, at the same time improving the classifier performance. The experiments carried out confirm that the proposed strategy significantly enhances the performance of the AL algorithm compared with the commonly used uncertainty strategies. It achieves a performance similar to that of fully supervised and semi-supervised algorithms while requiring much less labeling. As a future extension of this work, it would be interesting to integrate other evolutionary optimization algorithms and compare them with our approach. In addition, it is beneficial to test the impact of using other variants of PSO algorithm in our approach. Also, it is aimed to test more classification algorithms in the experimentation process.

An adaptive integral separated proportional–integral controller based strategy for particle swarm optimization

Particle swarm optimization algorithm (PSO), which updates the particle by the linear summation of the particle’s past momentum and current search direction, has demonstrated its power in many optimization applications. However, few researches have focused on the overshoot problem of PSO caused by past momentum, which may result in an oscillation search and slow convergence speed on complex optimization problems. Based on the connection between the PSO optimization process and the PID controller based control system, we first analyze the effect of the momentum in PSO, then we find that the oscillation problem relates to the gathering of the momentum term and the current search direction. Inspired by the conditional integration in automatic control, we propose an adaptive search direction learning approach for PSO, namely ISPSO (Integral Separated PI controller-based PSO). The ISPSO separates momentum term adaptively when the current search direction is consistent with historical momentum direction, and then the IS strategy will guide particles to fly to better and steady directions by eliminating the integral gathering of historical momentum. We select seven main-stream approaches as control group, and conduct experiments on benchmark CEC2013 test suite. The experimental results of ISPSO, providing the faster steady global convergence and higher solution accuracy, show a significant improvement on PSO algorithm. Compared with the results of the seven methods, the performance of ISPSO is also promising in general, especially for unimodal and composition functions. Furthermore, our results validate the generalization and effectiveness of IS strategy by the designed experiments of PSO variants with and without IS strategy, which also indicates that the IS strategy can be applied to PSO variants with any topological structures.

An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals

Abstract Random job arrivals that happen frequently in manufacturing practice may create a need for dynamic scheduling. This paper considers an issue of how to reschedule the randomly arrived new jobs to pursue both performance and stability of a schedule in a job shop. Firstly, a mixed integer programming model is established to minimize three objectives, including the discontinuity rate of new jobs during the processing, the makespan deviation of initial schedule, and the sequence deviation on machines. Secondly, four match-up strategies from references are modified to determine the rescheduling horizon. Once new jobs arrive, the rescheduling process is immediately triggered with ongoing operations remain. The ongoing operations are treated as machine unavailable constraints (MUC) in the rescheduling horizon. Then, a particle swarm optimization (PSO) algorithm with improvements is proposed to solve the dynamic job shop scheduling problem. Improvement strategies consist of a modified decoding scheme considering MUC, a population initialization approach by designing a new transformation mechanism, and a novel particle movement method by introducing position changes and a random inertia weight. Lastly, extensive experiments are conducted on several instances. The experiments results show that the modified rescheduling strategies are statistically and significantly better than the compared strategies. Moreover, comparative studies with five variants of PSO algorithm and three state-of-the-art meta-heuristics demonstrate the high performance of the improved PSO algorithm.

A discrete cooperatively coevolving particle swarm optimization algorithm for combinatorial double auctions

A combinatorial double auction is a type of double-side auction which makes buyers and sellers trade goods more conveniently than multiple combinatorial auctions. In this paper, we consider the combinatorial double auction problem in which there are transaction costs, supply constraints and surplus constraints. We formulate the WDP of combinatorial double auction problem as an integer programming problem formulation. The winner determination problem (WDP) in combinatorial double auctions poses a challenge due to computational complexity. Particle swarm optimization (PSO) is a well-known approach to deal with complex optimization problems. In the existing literature, different variants of PSO algorithms have been proposed. However, there still lacks a comparative study on effectiveness of applying different variants of PSO algorithms in combinatorial double auctions. As standard discrete PSO (DPSO) algorithm suffers from premature convergence problem, we adopt a coevolution approach to develop a discrete cooperatively coevolving particle swarm optimization (DCCPSO) algorithm that can scale with the problem. The effectiveness of the proposed algorithm is verified by comparing the results with several variants of PSO algorithms and Differential Evolution algorithms through simulation. Simulation results indicate that the proposed DCCPSO algorithm significantly outperforms these variants of PSO algorithms and Differential Evolution algorithms in most test cases of combinatorial double auctions.

A Quantum Particle Swarm Optimization Algorithm with Teamwork Evolutionary Strategy

The quantum particle swarm optimization algorithm is a global convergence guarantee algorithm. Its searching performance is better than the original particle swarm optimization algorithm (PSO), but the control parameters are less and easy to fall into local optimum. The paper proposed teamwork evolutionary strategy for balance global search and local search. This algorithm is based on a novel learning strategy consisting of cross-sequential quadratic programming and Gaussian chaotic mutation operators. The former performs the local search on the sample and the interlaced operation on the parent individual while the descendants of the latter generated by Gaussian chaotic mutation may produce new regions in the search space. Experiments performed on multimodal test and composite functions with or without coordinate rotation demonstrated that the population information could be utilized by the TEQPSO algorithm more effectively compared with the eight QSOs and PSOs variants. This improves the algorithm performance, significantly.

A comparison of global MPPT techniques for partially shaded grid-connected photovoltaic system

Maximizing the energy reproduced from a solar power generation system becomes a challenging task when high changes in irradiation or Partial Shading (PS) are experienced. The latter case is considered as one of the unavoidable complicated phenomena since the Photovoltaic (PV) system is extremely affected by displaying numerous local maxima. Thus, it is compulsory to rigorously choose an accurate Maximum Power Point Tracking (MPPT) which identifies effectively the unique Global Point (GP) and avoid any local peaks with the purpose of mitigating the impact of PS. Conventional methods are prone to failure in case of an unpredictable shadow. This paper introduces a comparative assessment of Particle Swarm Optimization (PSO) based MPPT, Genetic Algorithm (GA) based MPPT and P&O for a partially shaded grid-connected photovoltaic system. The main contribution of the paper consists in developing a new variant of PSO algorithm which is a good tradeoff between simplicity, speed, and efficiency. The grid side control is investigated as well through developing different control loops with PID controllers tuned by GA. Various schemes of irradiation and PS are used in order to verify the ability of the threefold algorithms to adequately track the GP.

Unsupervised Clustering Based an Adaptive Particle Swarm Optimization Algorithm

Clustering analysis is the major application area of data mining where particle swarm optimization (PSO) is being widely implemented due to its simplicity and efficiency. In this paper, we present a new variant of PSO algorithm well tailored to clustering analysis. The proposed algorithm encodes each particle as a bi-dimensional vector, where in the first dimension we look for the optimal number of clusters and in the second dimension, we look for the best centroid of each cluster. In this PSO clustering algorithm a new updating positions rule is proposed to deal with our clustering objective. The performance of the proposed algorithm is tested according to artificial datasets and real datasets. The achieved results present actually good performance and still promising in future perspective.

Hybrid PSO and SSO algorithm for truss layout and size optimization considering dynamic constraints

A hybrid approach of Particle Swarm Optimization (PSO) and Swallow Swarm Optimization algorithm (SSO) namely Hybrid Particle Swallow Swarm Optimization algorithm (HPSSO), is presented as a new variant of PSO algorithm for the highly nonlinear dynamic truss shape and size optimization with multiple natural frequency constraints. Experimentally validation of HPSSO on four benchmark trusses results in high performance in comparison to PSO variants and to those of different optimization techniques. The simulation results clearly show a good balance between global and local exploration abilities and consequently results in good optimum solution.

Scrutiny of multifarious particle swarm optimization for finding the optimal size of a PV/wind/battery hybrid system

In this paper, a network-independent pattern has been used to design a hybrid (PV/wind/Batt) system with high reliability and minimum production total costs over the life of the system. In such systems, optimum sizing is the main issue for having a cost-effective system. In this regard, studies the performance of different PSO (particle swarm optimization algorithm) variants to determine the optimum sizing of hybrid (PV/wind/Batt) system, namely, PSO, modified PSO (MPSO), PSO based on repulsion factor (PSO-RF), PSO with constriction factor (PSO-CF), and PSO with adaptive inertia weight (PSO-W). The system's components optimal size has been studied under various performance conditions using real-time information and meteorological data of one of three atypical regions located in Iran. Simulation results indicate that PSO-CF produces more promising results than the other variants, tabu search (TS), simulated annealing (SA) and harmony search (HS) algorithms in terms of mean (Mean), standard deviation (Std.), worst (Worst) and best (Best) the total annual cost (TAC).

Swarm Intelligence: Based Cooperation Optimization of Multi-Modal Functions

In this paper, an advanced particle swarm optimization algorithm (PSO) is proposed to solve multi-modal function optimization problems. Multiple swarms are used for parallel search, and an artificial repulsive potential field on local search space is set up to prevent multiple swarms converging to the same areas. In addition, this paper provides a theoretical analysis of the strategy of multi-swarm parallel search in algorithms. Finally, the proposed algorithm has been tested on three benchmark functions, and the results show a superior performance compared with other PSO variants.

Experimental study of a new hybrid PSO with mutation for economic dispatch with non-smooth cost function

Particle swarm optimization (PSO) is a population-based evolutionary technique. Advancements in the PSO development over the last decade have made it one of the most promising optimization algorithms for a wide range of complex engineering optimization problems which traditional derivative-based optimization techniques cannot handle. The most attractive features of PSO are its algorithmic simplicity and fast convergence. However, PSO tends to suffer from premature convergence when applied to strongly multi-modal optimization problems. This paper proposes a method of incorporating a real-valued mutation (RVM) operator into the PSO algorithms, aimed at enhancing global search capability. Three variants of PSO algorithms are considered. The resultant hybrid PSO-RVM algorithms are experimentally investigated along with the PSO variants and an existing PSO with Gaussian mutation using six typical benchmark functions. It is interesting to see that the effectiveness of RVM varies for different PSO variants as well as different kinds of functions. It has been found that one of the hybrid algorithms, CBPSO-RVM, which is an integration of the PSO with the constriction factor and inertia weight (CBPSO) and the RVM operator, exhibits significantly better performance in most of the test cases compared to the other algorithms under consideration. Furthermore, this algorithm is superior to most of the existing algorithms used in this study when applied to two practical ED problems with non-smooth cost function considering the multiple fuel type and/or valve-point loading effects.

Design of very thin wide band absorbers using modified local best particle swarm optimization

A method of using particle swarm optimization (PSO) algorithm to design electromagnetic absorber is presented. To demonstrate effectiveness of the PSO algorithm three different design cases are optimized. To reduce the local minimum traps, a modified local search strategy is employed. Each design problem is optimized using genetic algorithm (GA) and four variants of PSO algorithms, namely global PSO (gbest), local PSO (lbest), comprehensive learning PSO (CLPSO), and modified local PSO (MLPSO). The results clearly show that the MLPSO is a robust, fast, and useful optimization tool for designing absorbers. A seven-layer absorber achieved by this method has reflection coefficient below 18.7 dB from VHF to 20 GHz.