In this work, the performance of abc is enhanced by introducing the concept of oppositionbased learning. Though they have been widely used for singleobjective optimization since their inception, they suffer from premature convergence. Benchmark testing of the paradigm is described, and applications, including nonlinear function optimization and neural network training. Global best approaches global optimum swarm may still oscillate ypicallyt. Train operation strategy optimization based on a doublepopulation genetic particle swarm optimization algorithm kaiwei liu, xingcheng wang and zhihui qu school of marine electrical engineering, dalian maritime university, dalian 116026, china correspondence.
Particle swarm optimization pso is a stochastic algorithm used for the optimization problems proposed by kennedy 1 in 19 95. Regrouping particle swarm optimization rpso premature convergence 2011 x. Particle swarm optimization pso algorithm is a populationbased optimization method, which was originally introduced by eberhart and kennedy in 1995. Particle swarm optimizer is a swarm intelligent algorithm which simulates the behaviour of birds flocking and fish schooling. Inspired by social human behavior, a new kinetic equation i. Global best approaches a local optimum premature collapse of the swarm mathematical attempts typically oversimpli ed. Train operation strategy optimization based on a double.
An improved oppositionbased learning particle swarm optimization for the detection of snpsnp interactions junliangshang, 1 yansun, 1 shengjunli, 1 jinxingliu, 1,2 chunhouzheng, 3 andjunyingzhang 4 school of information science and engineering. Oppositionbased barebones particle swarm for constrained. Convergence to global optimum for a 1 particle swarm after in nite time f. A novel oppositionbased particle swarm optimization for noisy. Enhancing particle swarm optimization using generalized. The proposed method employs opposition based learning for each particle and applies a dynamic cauchy mutation on the best particle. In this work, the performance of abc is enhanced by introducing the concept of opposition based learning. To solve the problem of premature convergence in traditional particle swarm optimization pso, an opposition based particle swarm optimization with adaptive mutation strategy amopso is proposed in this paper. This paper presents an oppositionbased pso opso to accelerate the convergence of pso and avoid premature convergence. Research article an improved oppositionbased learning. The system is initialized with a population of random solutions and searches for optima by updating generations. Enhancing particle swarm optimization using generalized oppositionbased learning hui wanga,b.
Noninertial oppositionbased particle swarm optimization and. Opposition based initialization in particle swarm optimization opso. A migrantinspired path planning algorithm for obstacle. Request pdf on jul 23, 2016, jianhong zhou and others published an oppositionbased learning competitive particle swarm optimizer find, read and cite all the research you need on researchgate. To solve these problems, the paper proposes an effective approach, called particle swarm optimization based on multiple swarms and oppositionbased learning, which divides swarm into two subswarms. The proposed method employs oppositionbased learning for each particle and applies a dynamic cauchy mutation on the best particle. A concept for the optimization of nonlinear functions using particle swarm methodology is introduced. Highlights of ioblpso are the introduction of three strategies, namely, oppositionbased learning, dynamic inertia weight, and a postprocedure.
Proceedings of the third international conference on natural computation, vol. Pdf oppositionbased particle swarm optimization with. Particle swarm optimization pso is a stochastic, population based optimization method, which has been applied successfully to a wide range of problems. The adaptive mutation employs the distribution information of the candidate leader set to transfer the.
Although pso shares many similarities with evolutionary algorithms eas, the standard pso does not use evolution operators such as crossover and mutation. This paper presents an opposition based psoovcpso which uses velocity clamping to accelerate its convergence speed and to avoid premature convergence of algorithm. Gravitational search algorithm gsa and particle swarm optimization pso are natureinspired, swarmbased optimization algorithms respectively. Due to the slow convergent speed of particle and easily get trapped in the local optima, a novel simple pso algorithm with oppositionbased learning average elite strategy is proposed.
Highlights of ioblpso are the introduction of three strategies, namely, opposition based learning, dynamic inertia weight, and a postprocedure. Particle swarm optimization james kennedy russell eberhart the inventors. Noninertial oppositionbased particle swarm optimization. In the proposed method, generalized opposition based learning is incorporated first in population initialization and particle s personal best position. In addition, the oppositionbased learning obl can produce the opposition population to. Particle swarm optimization pso, part of the swarm intelligence family, is known to effectively solve largescale nonlinear optimization problems is called a1234. Pdf oppositionbased particle swarm optimization with velocity. A very brief introduction to particle swarm optimization. An improved opposition based learning particle swarm optimization for the detection of snpsnp interactions junliangshang, 1 yansun, 1 shengjunli, 1 jinxingliu, 1,2 chunhouzheng, 3 andjunyingzhang 4 school of information science and engineering, qufu normal university, rizhao, china. In this algorithm, a particle updating formula of the simplified swarm optimization spso algorithm is adopted. Due to the slow convergent speed of particle and easily get trapped in the local optima, a novel simple pso algorithm with opposition based learning average elite strategy is proposed. This paper presents an opposition based pso opso to accelerate the convergence of pso and avoid premature convergence. An improved oppositionbased learning particle swarm. For psos simple concept, easy implementation, and e.
Ieee congress evolutionary computation singapore, 2007, pp. To solve these problems, the paper proposes an effective approach, called particle swarm optimization based on multiple swarms and oppositionbased. But still there is a drawback in the pso is that it stuck in the local minima. Omran 6 proposed an opposition based learning to improve the performance of pso.
Particle swarm optimization with oppositionbased learning. Abstractstandard particle swarm optimization is easy to fall into local optimum and has the problem of low precision. Three particles of swarm are randomly selected and compared with each others which are called the winner, neutral, and loser candidate solutions based on the descent arrangement of their fitness. Particle swarm optimization pso is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling. Discrete particle swarm optimization dpso is a recently developed populationbased metaheuristic algorithm proposed by kang and he. In this study, an improved oppositionbased learning particle swarm optimization ioblpso is proposed for the detection of snpsnp interactions. A swarm optimization genetic algorithm based on quantum. Fully informed particle swarm optimization fipso optimization problems 2009 george i. Introduction in the past twenty years several swarm intelligence algorithms, inspired by natural phenomena or social behavior, have been proposed to solve various realworld and complex global optimization problems. Intelligent discrete particle swarm optimization for. Particle swarm optimization pso guides its search direction by a linear learning strategy in which each particle updates its velocity through a linear combination among its present status, historical best experience and the swarm best experience. Train operation strategy optimization based on a doublepopulation genetic particle swarm optimization algorithm kaiwei liu, xingcheng wang and zhihui qu school of marine electrical engineering, dalian maritime university, dalian 116026, china.
This paper presents a new algorithm to improve the efficiency of pso to cope with noisy optimization problems. Pdf opposition based particle swarm optimization opso. Mathematical modelling and applications of particle swarm. University of electronic science and technology of china zhongshan institute, zhongshan city, 528402, guangdong province, china. Obstacle avoidance is an important issue in robotics. Pso shares many similarities with evolutionary computation techniques such as genetic algorithms ga. A migrantinspired path planning algorithm for obstacle run. Particle swarm optimization based on multiple swarms and. Though many works have been done for the detection of snpsnp interactions, the algorithmic development is still ongoing. History of pso pso has been proposed by eberhart and kennedy in 1995. A new golden ratio local search based particle swarm.
The proposed approach obpso combines barebones particle swarm optimization bpso and opposition based learning obl to improve the quality of solutions. Particle swarm optimization pso is an optimization algorithm which has inspired by birds flocking. Particle swarm optimization pso is a stochastic, populationbased optimization method, which has been applied successfully to a wide range of problems. Partial oppositionbased particle swarm optimizer in artificial.
However, like other methods, pso has some disadvantages such as problems in finding the best global minimum or trapping in. A new golden ratio local search based particle swarm optimization. Opposition based particle swarm optimization opso to accelerate the convergence 2008 marco a. More and more researchers have been interested in pso methods which. Kennedy in 1995, inspired by social behavior of bird flocking or fish schooling. Ioblpso might be an alternative to existing methods for the detection of snp snp interactions. Particle swarm optimization pso was originally designed and introduced by eberhart and kennedy. Comparison of particle swarm optimization and genetic algorithm in rational function model optimization somayeh yavari a, mohammad javad valadan zoej, mehdi mokhtarzadea, ali mohammadzadeha a k. In pso, the position of a particle is represented by a vector in search space, and the movement of the particle is determined by an assigned vector called the velocity vector.
The artificial bee colony abc algorithm is a relatively new algorithm for function optimization. An improved particle swarm optimization based on the. This paper presents a new algorithm for initialization of population in standard pso called opposition based particle swarm optimization opso. Experimental results on many wellknown benchmark optimization problems have shown that. The particle swarm optimization research toolbox was written to assist with thesis research combating the premature convergence problem of particle swarm optimization pso. In this paper, the particle swarm optimization pso algorithm, which is inspired by the collective behaviors of birds, has been designed for solving the obstacle avoidance problem. In this paper, a hybrid pso variant is presented to enhance its performance. The pso is a population based search algorithm based on the simulation of the social behavior of birds, bees or a school of fishes. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search.
Simple pso algorithm with oppositionbased learning. Oppositionbased particle swarm algorithm with cauchy mutation. In this paper, amultiobjective optimization based on opposition learning particle swarm named oblpso for convenience is proposed, which uses the concepts of opposition learning and pareto dominance to determine the evolution direction of a particle. There are several schools of thought as to why and how the pso algorithm can perform optimization a common belief amongst researchers is that the swarm behaviour varies between exploratory behaviour, that is, searching a broader region of the searchspace, and exploitative behaviour, that is, a locally oriented search so as to get closer to a possibly local optimum. Pdf this paper presents an oppositionbased psoovcpso which uses velocity clamping to accelerate its convergence speed and to avoid premature. This paper presents an improved oppositionbased particle swarm optimizer pso with partial oppositionbased learning. The new algorithm is called ofdrpso which employs oppositionbased learning obl and fitnessdistanceratio fdr. The proposed approach obpso combines barebones particle swarm optimization bpso and oppositionbased learning obl to improve the quality of solutions.
An overview of particle swarm optimization variants. In 41 author presents a new variant for initialization of population in standard pso called opposition based particle swarm optimization opso to improve convergence characteristics of pso. Author links open overlay panel lanlan kang a 1 rueyshun chen b wenliang cao b 2 yehcheng chen c. In one they just generate the opposite particles then calculate the fitness of both. The adaptive mutation employs the distribution information of the candidate leader set to transfer the stagnated particle to a potentially promising area. Toosi university of technology, geodesy and geomatics eng. It solves a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the searchspace according to simple mathematical formulae. In computational science, particle swarm optimization pso is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Particle swarm optimization pso was firstly introduced by kennedy and eberhart in 1995 1. In this study, an improved oppositionbased learning particle swarm optimization ioblpso is proposed for the detection of snpsnp. The particle swarm optimization algorithm abbreviated as pso is a novel population based stochastic search algorithm and an alternative solution to the complex nonlinear optimization problem. Partial oppositionbased particle swarm optimizer in. The algorithm is inspired by the foraging behavior of honey bees. It is a very good technique for the optimization problems.
In this study, an improved opposition based learning particle swarm optimization ioblpso is proposed for the detection of snpsnp interactions. Oppositionbased particle swarm algorithm with cauchy. An oppositionbased learning competitive particle swarm. Particle swarm optimization pso algorithm is a population based optimization method, which was originally introduced by eberhart and kennedy in 1995. Opposition base learning and velocity clamping are two fundamental phases of oppositionbased particle swarm optimization with velocity clamping algorithm ovcpso defined in 16. Noninertial oppositionbased particle swarm optimization and its theoretical analysis for deep learning applications. A novel oppositionbased particle swarm optimization for noisy problems. Particle swarm optimization pso is a population based stochastic optimization technique developed by dr. It is a simple evolutionary algorithm which differs from other. This paper presents a modified barebones particle swarm optimization obpso to solve constrained nonlinear optimization problems. Some animals that travel to the different places at a specific time of the year are called migrants. The usual aim of the particle swarm optimization pso algorithm is to solve an unconstrained minimization problem.
Pdf on jul 1, 2009, hajira jabeen and others published opposition based particle swarm optimization opso find, read and cite all the research you need on researchgate. Mar 24, 2006 particle swarm optimization pso was originally designed and introduced by eberhart and kennedy. Introduction particle swarm optimization pso is a population based stochastic optimization technique developed by dr. An improved cat swarm optimization algorithm based on. Benchmark testing of the paradigm is described, and applications, including nonlinear function optimization and neural network training, are proposed. Probabilistic opposition based learning for particles has been used in the proposed. This paper presents an oppositionbased psoovcpso which uses velocity clamping to accelerate its convergence speed and to avoid premature. Liu, oppositionbased particle swarm algorithm with cauchy mutation, in proc. Alsharhan, using oppositionbased learning to improve the performance of particle swarm optimization, in proc. Particle swarm optimization pso is a populationbased stochastic search algorithm developed by kennedy and eberhart 1. An improved cat swarm optimization algorithm based on oppositionbased learning and cauchy operator for clustering. The control panel offers ample flexibility to accommodate various research directions. To solve the problem of premature convergence in traditional particle swarm optimization pso, an oppositionbased particle swarm optimization with adaptive mutation strategy amopso is proposed in this paper.
Snpsnp interactions have been receiving increasing attention in understanding the mechanism underlying susceptibility to complex diseases. Journal of information processing systems, 4, 2017, 10. Particle swarm optimization ieee conference publication. In all the variants of pso, the generalized opposition based pso gopso, which introduces the generalized opposition based learning gobl, is a prominent one. This paper presents an improved opposition based particle swarm optimizer. Convergence to global optimum for a 1particle swarm after in nite time f. Such a velocity update strategy is easy to achieve, but it is experimentally inefficient when searching in a complex space. The particle swarm optimization algorithm abbreviated as pso is a novel populationbased stochastic search algorithm and an alternative solution to the complex nonlinear optimization problem. Opposition based ini tialization in particle swa rm optimization opso. Oppositionbased particle swarm optimization with velocity. Pdf opposition based initialization in particle swarm. Oppositionbased particle swarm optimization with adaptive. In all the variants of pso, the generalized oppositionbased pso gopso, which introduces the generalized oppositionbased learning gobl, is a prominent one. Simple pso algorithm with oppositionbased learning average.
766 1139 1017 1164 518 1552 606 1372 13 1081 236 1461 97 1359 1407 1387 53 784 903 1122 172 82 912 1489 663 1100 673 587 782 1345 1321 698 458 935 1426 89 1381 331 995 1304 134 743 1433 1128 1432 1323