Particle Swarm Optimization with New Initializing Technique to Solve Global Optimization Problems (original) (raw)
Related papers
A New Initialization Approach in Particle Swarm Optimization for Global Optimization Problems
Computational Intelligence and Neuroscience
Particle swarm optimization (PSO) algorithm is a population-based intelligent stochastic search technique used to search for food with the intrinsic manner of bee swarming. PSO is widely used to solve the diverse problems of optimization. Initialization of population is a critical factor in the PSO algorithm, which considerably influences the diversity and convergence during the process of PSO. Quasirandom sequences are useful for initializing the population to improve the diversity and convergence, rather than applying the random distribution for initialization. The performance of PSO is expanded in this paper to make it appropriate for the optimization problem by introducing a new initialization technique named WELL with the help of low-discrepancy sequence. To solve the optimization problems in large-dimensional search spaces, the proposed solution is termed as WE-PSO. The suggested solution has been verified on fifteen well-known unimodal and multimodal benchmark test problems e...
An Improved Particle Swarm Optimization Algorithm with Chi-Square Mutation Strategy
Particle Swarm Optimization (PSO) algorithm is a population-based strong stochastic search strategy empowered from the inherent way of the bee swarm or animal herds for seeking their foods. Consequently, flexibility for the numerical experimentation, PSO has been used to resolve diverse kind of optimization problems. PSO is much of the time caught in local optima in the meantime taking care of the complex real-world problems.Considering this, a novel modified PSO is introduced by proposing a chi square mutation method. The main functionality of mutation operator in PSO is quick convergence and escapes from the local minima. Population initialization plays a critical role in meta-heuristic algorithm. Moreover, in this work, to improve the convergence, rather applying random distribution for initialization, two quasi random sequences Halton and Sobol have been applied and properly joined with chi-square mutated PSO (Chi-Square PSO) algorithm. The promising experimental result suggests the superiority of the proposed technique. The results present foresight that how the proposed mutation operator influences on the value of cost function and divergence. The proposed mutated strategy is applied for eight (8) benchmark functions extensively used in the literature. The simulation results verify that Chi-Square PSO provide efficient results over other tested algorithms implemented for the function optimization.
Applied Sciences, 2021
Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. For an optimization problem, population initialization plays a significant role in metaheuristic algorithms. These algorithms can influence the convergence to find an efficient optimal solution. Mainly, for recognizing the importance of diversity, several researchers have worked on the performance for the improvement of metaheuristic algorithms. Population initialization is a vital factor in metaheuristic algorithms such as PSO and DE. Instead of applying the random distribution for the initialization of the population, quasirandom sequences are more useful for the improvement the diversity and convergence factors. This study presents three new low-discrepancy sequences named WELL sequence, Knuth sequence, and Torus sequence to initialize the population in the search space. This paper also gives a comprehensive survey of the various PSO and DE initialization approaches based on the family...
Particle Swarm Optimization With Probability Sequence for Global Optimization
IEEE Access
Particle Swarm Optimization (PSO) has been frequently employed to solve diversified optimization problems. Choosing initial placement for population plays an important role in meta-heuristic methods since they can significantly converge. In this study, probability distribution has been introduced to enhance the diversity of swarm and convergence speed. Population initialization method based on uniform distribution is normally used when there is no preceding knowledge available regarding the candidate solution. In this paper, a new approach to initialize population is proposed using probability sequence Weibull marked as (WI-PSO) that applies the probability distribution to generate numbers at random locations for swarm initialization. The proposed method (WI-PSO) is tested on sixteen well-known uni-modal and multi-modal benchmark test functions broadly adopted by the research community and its encouraging performance is investigated and compared with the Exponential distribution based PSO (E-PSO), Beta distribution based PSO (BT-PSO), Gamma distribution based PSO (GA-PSO) and Log-normal distribution based PSO (LN-PSO). Artificial Neural Networks (ANNs) have become the most powerful tool for classification of complex benchmark problems. We have experimented the proposed method (WI-PSO) for weight optimization of a feed-forward neural network to ensure its purity and have compared with conventional back-propagation algorithm (BPA), E-PSO, BT-PSO, GA-PSO and LN-PSO. Due to flexible behaviour in the degree of freedom, the experimental results infer the perfection and dominance of the Weibull based population initialization. The result exhibits the anticipation of influence exerted by the proposed technique on all sixteen objective functions and eight real-world benchmark data sets. INDEX TERMS Particle swarm optimization, Weibull distribution, neural networks.
Improved particle swarm optimization with low-discrepancy sequences
2008
Abstract Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequences, but are more useful for computational methods which depend on the generation of random numbers. Some of these tasks involve approximation of integrals in higher dimensions, simulation and global optimization. Sobol, Faure and Halton sequences have already been used [7, 8, 9, 10] for initializing the swarm in a PSO.
Overview of Particle Swarm Optimization ( PSO ) on its Applications and Methods
2013
Particle Swarm Optimization (PSO) that is famous as a heuristic robust stochastic optimization technique works in field of Artificial Intelligence (AI). This technique of optimization is inspired by certain behaviors of animals such as bird flocking. The base of PSO method is on swarm intelligence that has a huge effect on solving problem in social communication. Hence, the PSO is a useful and valuable technique with goal of maximizing or minimizing of certain value that has been used in wide area and different fields such as large field of engineering, physics, mathematics, chemistry and etc. in this paper, following a brief introduction to the PSO algorithm, the method of that is presented and it’s important factors and parameters are summarized. The main aim of this paper is to overview, discuss of the available literature of the PSO algorithm yearly.
Particle Swarm Optimization algorithm based on Diversified Artificial Particles (PSO-DAP)
2013
Speed of convergence in the PSO is very high, and this issue causes to the algorithm can't investigate search space truly, When diversity of the population decreasing, all the population start to liken together and the algorithm converges to local optimal swiftly. In this paper we implement a new idea for better control of the diversity and have a good control of the algorithm's behavior between exploration and exploitations phenomena to preventing premature convergence. In our approach we have control on diversity with generating diversified artificial particles (DAP) and injection them to the population by a particular mechanism when diversity lessening, named Particle Swarm Optimization algorithm based on Diversified Artificial Particles (PSO-DAP). The performance of this approach has been tested on the set of ten standard benchmark problems and the results are compared with the original PSO algorithm in two models, Local ring and Global star topology. The numerical results show that the proposed algorithm outperforms the basic PSO algorithms in all the test cases taken in this study
Particle swarm optimization: performance tuning and empirical analysis
2009
This chapter presents some of the recent modified variants of Particle Swarm Optimization (PSO). The main focus is on the design and implementation of the modified PSO based on diversity, Mutation, Crossover and efficient Initialization using different distributions and Low-discrepancy sequences. These algorithms are applied to various benchmark problems including unimodal, multimodal, noisy functions and real life applications in engineering fields. The effectiveness of the algorithms is discussed.
Improved Opposition-Based Particle Swarm Optimization Algorithm for Global Optimization
Symmetry, 2021
Particle Swarm Optimization (PSO) has been widely used to solve various types of optimization problems. An efficient algorithm must have symmetry of information between participating entities. Enhancing algorithm efficiency relative to the symmetric concept is a critical challenge in the field of information security. PSO also becomes trapped into local optima similarly to other nature-inspired algorithms. The literature depicts that in order to solve pre-mature convergence for PSO algorithms, researchers have adopted various parameters such as population initialization and inertia weight that can provide excellent results with respect to real world problems. This study proposed two newly improved variants of PSO termed Threefry with opposition-based PSO ranked inertia weight (ORIW-PSO-TF) and Philox with opposition-based PSO ranked inertia weight (ORIW-PSO-P) (ORIW-PSO-P). In the proposed variants, we incorporated three novel modifications: (1) pseudo-random sequence Threefry and P...