Particle Swarm Optimization with Adaptive Mutation

A new adaptive mutation particle swarm optimizer,which is based on the variance of the population's fitness,is presented in this paper.During the running time,the mutation probability for the current best particle is determined by two factors:the variance of the population's fitness and the current optimal solution.The ability of particle swarm optimization(PSO)algorithm to break away from the local optimum is greatly improved by the mutation.The experimental results show that the new algorithm not only has great advantage of convergence property over genetic algorithm and PSO,but can also avoid the premature convergence problem effectively.

Prediction model for permeability index by integrating case-based reasoning with adaptive particle swarm optimization

To effectively predict the permeability index of smelting process in the imperial smelting furnace, an intelligent prediction model is proposed. It integrates the case-based reasoning （CBR） with adaptive par- ticle swarm optimization （PSO）. The nmnber of nearest neighbors and the weighted features vector are optimized online using the adaptive PSO to improve the prediction accuracy of CBR. The adaptive inertia weight and mutation operation are used to overcome the premature convergence of the PSO. The proposed method is validated a compared with the basic weighted CBR. The results show that the proposed model has higher prediction accuracy and better performance than the basic CBR model.

Particle Swarm Optimization with Directed Mutation

In the standard particle swarm optimization(SPSO),the big problem is that it suffers from premature convergence,that is,in complex optimization problems,it may easily get trapped in local optima.In order to mitigate premature convergence problem,this paper presents a new algorithm,which is called particle swarm optimization(PSO) with directed mutation,or DMPSO.The main idea of this algorithm is to "let the best particle(the smallest fitness of the particle swarm) become more excellent and the worst particle(the largest fitness of the particle swarm) try to be excellent".The new algorithm is tested on a set of eight benchmark functions,and compared with those of other four PSO variants.The experimental results illustrate the effectiveness and efficiency of the DMPSO.The comparisons show that DMPSO significantly improves the performance of PSO and searching accuracy.

Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.

Adaptive multi-feature tracking in particle swarm optimization based particle filter framework

This paper proposes a particle swarm optimization（PSO） based particle filter（PF） tracking framework,the embedded PSO makes particles move toward the high likelihood area to find the optimal position in the state transition stage,and simultaneously incorporates the newest observations into the proposal distribution in the update stage.In the proposed approach,likelihood measure functions involving multiple features are presented to enhance the performance of model fitting.Furthermore,the multi-feature weights are self-adaptively adjusted by a PSO algorithm throughout the tracking process.There are three main contributions.Firstly,the PSO algorithm is fused into the PF framework,which can efficiently alleviate the particles degeneracy phenomenon.Secondly,an effective convergence criterion for the PSO algorithm is explored,which can avoid particles getting stuck in local minima and maintain a greater particle diversity.Finally,a multi-feature weight self-adjusting strategy is proposed,which can significantly improve the tracking robustness and accuracy.Experiments performed on several challenging public video sequences demonstrate that the proposed tracking approach achieves a considerable performance.

A New Clustering Algorithm Using Adaptive Discrete Particle Swarm Optimization in Wireless Sensor Network

Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Adaptive stochastic resonance method for weak signal detection based on particle swarm optimization

In order to solve the parameter adjustment problems of adaptive stochastic resonance system in the areas of weak signal detection,this article presents a new method to enhance the detection efficiency and availability in the system of two-dimensional Duffing based on particle swarm optimization.First,the influence of different parameters on the detection performance is analyzed respectively.The correlation between parameter adjustment and stochastic resonance effect is also discussed and converted to the problem of multi-parameter optimization.Second,the experiments including typical system and sea clutter data are conducted to verify the effect of the proposed method.Results show that the proposed method is highly effective to detect weak signal from chaotic background,and enhance the output SNR greatly.

Quantum particle swarm optimization for micro-grid system with consideration of consumer satisfaction and benefit of generation side

Considering comprehensive benefit of micro-grid system and consumers,we establish a mathematical model with the goal of the maximum consumer satisfaction and the maximum benefit of power generation side in the view of energy management.An improved multi-objective local mutation adaptive quantum particle swarm optimization(MO-LM-AQPSO)algorithm is adopted to obtain the Pareto frontier of consumer satisfaction and the benefit of power generation side.The optimal solution of the non-dominant solution is selected with introducing the power shortage and power loss to maximize the benefit of power generation side,and its reasonableness is verified by numerical simulation.Then,translational load and time-of-use electricity price incentive mechanism are considered and reasonable peak-valley price ratio is adopted to guide users to actively participate in demand response.The simulation results show that the reasonable incentive mechanism increases the benefit of power generation side and improves the consumer satisfaction.Also the mechanism maximizes the utilization of renewable energy and effectively reduces the operation cost of the battery.

Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

Adaptive Particle Swarm Optimization Data Hiding for High Security Secret Image Sharing

The main aim of this work is to improve the security of data hiding forsecret image sharing. The privacy and security of digital information have becomea primary concern nowadays due to the enormous usage of digital technology.The security and the privacy of users’ images are ensured through reversible datahiding techniques. The efficiency of the existing data hiding techniques did notprovide optimum performance with multiple end nodes. These issues are solvedby using Separable Data Hiding and Adaptive Particle Swarm Optimization(SDHAPSO) algorithm to attain optimal performance. Image encryption, dataembedding, data extraction/image recovery are the main phases of the proposedapproach. DFT is generally used to extract the transform coefficient matrix fromthe original image. DFT coefficients are in float format, which assists in transforming the image to integral format using the round function. After obtainingthe encrypted image by data-hider, additional data embedding is formulated intohigh-frequency coefficients. The proposed SDHAPSO is mainly utilized for performance improvement through optimal pixel location selection within the imagefor secret bits concealment. In addition, the secret data embedding capacityenhancement is focused on image visual quality maintenance. Hence, it isobserved from the simulation results that the proposed SDHAPSO techniqueoffers high-level security outcomes with respect to higher PSNR, security level,lesser MSE and higher correlation than existing techniques. Hence, enhancedsensitive information protection is attained, which improves the overall systemperformance.

Particle Swarm Optimization Algorithm vs Genetic Algorithm to Develop Integrated Scheme for Obtaining Optimal Mechanical Structure and Adaptive Controller of a Robot

The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.

Dynamical Adaptive Particle Swarm Algorithm and Its Application to Optimization of PID Parameters

Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation shows that this new method makes the optimization perfectly and convergence quickly.

A Hybrid Differential Evolution Algorithm Integrated with Particle Swarm Optimization

To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.

Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Adaptive Parallel Particle Swarm Optimization Algorithm Based on Dynamic Exchange of Control Parameters

Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.

Improved particle swarm optimization algorithm for fuzzy multi-class SVM

An improved particle swarm optimization（PSO） algorithm is proposed to train the fuzzy support vector machine（FSVM） for pattern multi-classification.In the improved algorithm,the particles studies not only from itself and the best one but also from the mean value of some other particles.In addition,adaptive mutation was introduced to reduce the rate of premature convergence.The experimental results on the synthetic aperture radar（SAR） target recognition of moving and stationary target acquisition and recognition（MSTAR） dataset and character recognition of MNIST database show that the improved algorithm is feasible and effective for fuzzy multi-class SVM training.

Seepage safety monitoring model for an earth rock dam under influence of high-impact typhoons based on particle swarm optimization algorithm

Extreme hydrological events induced by typhoons in reservoir areas have presented severe challenges to the safe operation of hydraulic structures. Based on analysis of the seepage characteristics of an earth rock dam, a novel seepage safety monitoring model was constructed in this study. The nonlinear influence processes of the antecedent reservoir water level and rainfall were assumed to follow normal distributions. The particle swarm optimization （PSO） algorithm was used to optimize the model parameters so as to raise the fitting accuracy. In addition, a mutation factor was introduced to simulate the sudden increase in the piezometric level induced by short-duration heavy rainfall and the possible historical extreme reservoir water level during a typhoon. In order to verify the efficacy of this model, the earth rock dam of the Siminghu Reservoir was used as an example. The piezometric level at the SW1-2 measuring point during Typhoon Fitow in 2013 was fitted with the present model, and a corresponding theoretical expression was established. Comparison of fitting results of the piezometric level obtained from the present statistical model and traditional statistical model with monitored values during the typhoon shows that the present model has a higher fitting accuracy and can simulate the uprush feature of the seepage pressure during the typhoon perfectly.

Immunity clone algorithm with particle swarm evolution

Combining the clonal selection mechanism of the immune system with the evolution equations of particle swarm optimization, an advanced algorithm was introduced for functions optimization. The advantages of this algorithm lies in two aspects. Via immunity operation, the diversity of the antibodies was maintained, and the speed of convergent was improved by using particle swarm evolution equations. Simulation programme and three functions were used to check the effect of the algorithm. The advanced algorithm were compared with clonal selection algorithm and particle swarm algorithm. The results show that this advanced algorithm can converge to the global optimum at a great rate in a given range, the performance of optimization is improved effectively.