PARTICLE SWARM OPTIMIZATION (PSO) [1] is an
|
|
- Elfreda Nelson
- 5 years ago
- Views:
Transcription
1 Proceedings of International Joint Conference on Neural Netorks, Atlanta, Georgia, USA, June -9, 9 Netork-Structured Particle Sarm Optimizer Considering Neighborhood Relationships Haruna Matsushita and Yoshifumi Nishio Abstract This study proposes a ne Netork-Structured Particle Sarm Optimizer considering neighborhood relationships (NS-). All particles of NS- are connected to adjacent particles by a neighborhood relation of the -dimensional netork. The directly connected particles share the information of their on best position. Each particle is updated depending on the neighborhood distance on the netork beteen it and a inner, hose function value is best among all particles. Simulation results sho the searching efficiency of NS-. I. INTRODUCTION PARTICLE SWARM OPTIMIZATION () [] is an evolutionary algorithm to simulate the movement of flocks of birds. Due to the simple concept, easy implementation, and quick convergence, has attracted much attention and is used to ide applications in different fields in recent years. Hoever, greatly depends on its parameters and converges prematurely in case of solving complex problems hich have local optima. Furthermore, in the standard algorithm, there are no special relationships beteen particles. Each particle position is updated according to its personal best position and the best particle position among the all particles. Then, hich position is more important for each particle is determined at random in every generation. On the other side, in the real orld, various personal relationships exist, such as the hierarchical relationship, the trust relationships, the parentschild relationship and so on. Various topological neighborhoods have been considered by researches [] []. They have applied ring neighborhood, the von Neumann neighborhood, or some other topological neighborhoods. Hoever, the parameters are increased by using fourth term for considering the neighboring best position hen updating the velocity. Moreover, if there are no connections in respective particles, the computation costs are increased because e have to search each particle s neighborhood by using particle position or its cost ith a neighborhood radius in every generation. In this study, e propose a ne algorithm ith topological neighborhoods; Netork-Structured Particle Sarm Optimizer considering neighborhood relationships (NS- ). All particles of NS- are connected to adjacent particles by a neighborhood relation, hich dictates the topology of the -dimensional netork. The connected particles, namely neighboring particles on the netork, share the Haruna Matsushita and Yoshifumi Nishio are ith the Department of Electrical and Electronic Engineering, Tokushima University, Tokushima, 77, Japan (phone: + 77; fax: + 77; {haruna, nishio}@ee.tokushima-u.ac.jp). information of their on best position. In every generation, e find a inner particle, hose function value is the best among all particles, and each particle is updated depending on the neighborhood distance beteen it and the inner on the netork. Simulation results and comparisons ith the standard sho that the proposed NS- can effectively enhance the searching efficiency by measuring in terms of accuracy, robustness and parameter-dependence. II. STANDARD PARTICLE SWARM OPTIMIZATION () is an evolutionary algorithm to simulate the movement of flocks of birds. In the algorithm of, multiple solutions called particles coexist. At each time step, the particle flies toards its on past best position and the best position among all particles. Each particle has to information; position and velocity. The position vector of each particle i and its velocity vector are represented by X i = (x i,,x id,,x id ) and V i =(v i,,v id,,v id ), respectively, here (d =,,,D), (i =,,,M)and x id [x min,x max ]. () (Initialization) Let a generation step t =. Randomly initialize the particle position X i and its velocity V i for each particle i, and initialize P i =(p i,p i,,p id ) ith a copy of X i. Evaluate the objective function f(x i ) for each particle i and find P g ith the best function value among the all particles. () Evaluate the fitness f(x i ). For each particle i, if f(x i ) <f(p i ), the personal best position (called pbest) P i = X i.letp g represents the best position ith the best fitness among all particles so far (called gbest). Update P g, if needed. (3) Update V i and X i of each particle i depending on its pbest and gbest according to v id (t +)=v id (t)+c rand( )(p id x id (t)) + c Rand( )(p g x id (t)), x id (t +)= x id (t)+v id (t +), here is the inertia eight determining ho much of the previous velocity of the particle is preserved. c and c are to positive acceleration coefficients, generally c = c. rand( ) and Rand( ) are to uniform random numbers samples from U(, ). () Let t = t + and go back to (). () /9/$. 9 IEEE 3
2 Neighborhood A Neighborhood B Fig.. Netork-structure and neighborhood relationships. -neighborhood of the particle is Neighborhood A containing the particle 7,,, 3 and 7. -neighborhood of the particle is Neighborhood B containing the particle 9, 3,, and 9. If f(p 3 ) is the smallest value among Neighborhood A, then lbest of the particle is L = P 3.Iff(P ) is the smallest value among Neighborhood B, then lbest of the particle is L = P. III. NETWORK-STRUCTURED PARTICLE SWARM OPTIMIZER CONSIDERING NEIGHBORHOOD RELATIONSHIPS (NS-) The algorithm of NS- is almost same as the standard. The most important feature of NS- is that all particles are organized on a rectangular -dimensional grid as Fig.. In other ords, the particles are connected to adjacent particles by the neighborhood relation, hich dictates the topology of the netork. Furthermore, the particles share the local best position beteen the neighborhood particles directly connected. We should note the mean of neighborhood. In some research, the neighboring particles ere defined as the particle ith similar cost values or as the particles hose position are close to each other. Hoever, in this study, the particles, hich are directly connected on the netork, are defined as neighborhood even if their positions or their costs are far. (NS-) (Initialization) Let a generation step t =and initialize particle informationton according to (). Define g as the inner c. FindL i = (l i,l i,,l id ) ith the best function value among the directly connected particles, namely on neighbors. (NS-) Evaluate the fitness f(x i ) and find a inner particle c ith the best fitness among the all particles at current time t; c =argmin i {f (X i (t))}. () For each particle i, iff(x i ) <f(p i ), the personal best position pbest P i = X i. If f(x c ) <f(p g ), update gbest P g = X c,herex c = (x c,x c,,x cd ) is the position of the inner c. (NS-3) Find each local best position (called lbest) L i among the particle i and its neighborhoods hich are directly connected ith i on the netork as Fig.. For each particle i, iff(p i ) <f(l i ), update lbest L i = P i. (NS-) Update V i and X i of each particle i depending on its lbest, position of the inner X c and the distance on the netork beteen i and the inner c, according to v id (t +)=v id (t)+c rand( )(l id x id (t)) + c h c,i (x cd x id (t)), x id (t +)= x id (t)+v id (t +), here h c,i is the fixed neighborhood function defined by h c,i =exp ( r i r c ) σ, () here r i r c is the distance beteen netork nodes c and i on the netork, the fixed parameter σ corresponds to the idth of the neighborhood function. Therefore, the large σ strengthens particles spreading force to the hole space, and the small σ strengthens their convergent force toard the inner. (NS-) Let t = t + and go back to (NS-). IV. EXPERIMENTAL RESULTS In order to evaluate the performance of NS-, e use eight benchmark optimization problems summarized in Table I. The optimum solution x of Rosenbrock s function f is [,,...,], and x of the other functions are all [,,...,]. The optimum function values f(x ) of all functions are. f, f, f 3 and f are unimodal functions shon in Figs., and f, f, f 7 and f are multimodal functions shon in Figs. ith numerous local minima. Grieank s function ith full definition range as Fig. looks similar to Sphere function as Fig. hich is the unimodal. Hoever, in the inner area as Fig. (i), there are a lot of small peaks and valleys. All the functions have D variables. In this study, D is set to and to investigate the performances in various dimensions. The population size M is set to 3 in, and the netork size is in NS-. For and NS-, the parameters are set as =.7 and c = c =.. The neighborhood radius σ of NS- for f ith D = are 3, hile they are all. for f ith D =and the other functions ith both dimensions. Because Ackley s function f ith D = is difficult to optimize, the particles of NS- need much information of the neighbors. We carry out the simulations repeated 3 times for all the optimization functions ith 3 generations. The performances ith the minimum and mean function values and the standard deviation over 3 independent runs on eight functions ith and dimensions are listed in Tables II and III, respectively. We can see that NS- can obtain the better mean values for all the test functions. In particular, NS- greatly improves the performance from on f, f 3, f and f ith D =and on f, f 3, f and f ith D =. Furthermore, NS- can achieve the better minimum values 7 times on both dimensions. From these results, e can say that NS- algorithm can obtain the better results for the test functions ith both D =and. Figure 3 shos the mean gbest value of every generation over 3 runs for eight test functions ith dimensions. (3) 39
3 TABLE I EIGHT TEST FUNCTIONS. Function name Test Function Initialization Space Sphere function; f (x) = D D Rosenbrock s function; f (x) = 3 rd De Jong s function; f 3 (x) = th De Jong s function; f (x) = Rastrigin s function; f (x) = x d, x [.,.7]D ( ( x d x d+ ) +( xd ) ), x [.,.7] D D x d, x [.,.7] D D dx d, x [.,.7] D D ( x d cos (πx d )+ ), x [.,.] D D Ackley s function; f (x) = ( + e e..(x d +x d+ ) e.(cos(πx d)+cos(πx d+ )) ), x [ 3, 3] D D Stretched V sine ave function; f 7 (x) = (x d + x d+). ( +sin ((x d + x d+). ) ), x [, ] D Grieank s function; f (x) = D x d D ( ) xd cos +, x [, ] D d TABLE II COMPARISON RESULTS OF AND NS- ON TEST FUNCTIONS WITH D =. f Method Mean Minimum Std f.3e-.e-.e-7 NS-.3e-.e-3.7e- f NS f 3.7e-.e-9.e- NS-.9e-7 3.e- 7.e-7 f 9.3e-3.3e-.e-3 NS- 3.7e- 9.9e-.3e- f NS f NS f NS f 9.e-.7 NS-.e-.e- TABLE III COMPARISON RESULTS OF AND NS- ON TEST FUNCTIONS WITH D =. f Method Mean Minimum Std f.e- 9.e-7.e-3 NS-.e- 3.e- 7.9e- f NS f e-3.3 NS-. 3.e-3.7 f.e-7 7.e- 7.3e-7 NS- 3.7e-.e-.e-9 f NS f NS f NS f..e-.3 NS-..e-.79 The convergence rate of NS- is almost same or sloer than the standard. In the standard, the particles move toard gbest or toard pbest, hoever, the direction, hich more particles move toard, is decided at random on every generation. On the other hand, the neighborhood gaussian function is used in NS-, then, the particles
4 x 3... (i) Fig.. Eight test functions ith to variables. First and second variables are on the x-axis and y-axis, respectively, and z-axis shos its function value. Sphere function. Rosenbrock s function. 3rd De Jong s function. th De Jong s function. Rastrigin s function. Ackley s function. Stretched V sine ave function. Grieank s function ith full definition range. (i) Inner area of Grieank s function from - to. move according to the neighborhood distance beteen the inner and them. The inner s neighborhood particles move toard the inner, so that they spread to hole space. For the particles hich are not -neighbors of the inner but are connected near the inner, the gravitation toard the inner is strong. The other particles fly toard their lbest. In other ords, the roles of the NS- particles are determined by the connection relationship, and they produce the diversity of the particles. These effects avert the premature convergence, and the particles of NS- can easily escape from the local optima. Next, e consider the robustness of both algorithms by measuring by the standard deviation of all simulations. From the standard deviations in Tables II and III, the standard and NS- obtain the smaller values and times on both dimensions, respectively. Therefore, NS- appears to be more robust than the standard. The particle s velocity and its position of NS- is updated by according to the connection relationship although the standard is updated at completely random. Therefore, NS- can achieve the stable better performance unaffected by the initial states of the particles. V. PARAMETER D EPENDENCE Furthermore, e investigate the effect of the parameters; the inertia eight and the acceleration coefficients c and c, on performance quality and their sensitivity. Figure shos the mean fitness value of gbest ith different over 3 runs for all the test functions ith dimensions. The fixed parameters are same as above simulations. We can see that NS- achieve better performances than the standard even if the inertia eight is varied. If e decrease or increase by just., the performance of the standard becomes drastically orse as especially
5 Function Value Function Value Function Value Function Value Function Value Function Value Function Value Function Value Fig. 3. Mean gbest value of every generation for -dimensional eight functions. Sphere function. Rosenbrock s function. 3 rd De Jong s function. th De Jong s function. Rastrigin s function. Ackley s function. Stretched V sine ave function. Grieank s function. Figs., and. Oh the other hand, NS- is more effective and robust than the standard if the inertia eight is set as a small value ( [.,.]) []as especially multimodal functions shon in Figs.. Figure shos the mean fitness value of gbest ith different c (= c ) over 3 runs for all the test functions ith dimensions. We should note that for f 3 and f, the minimum gbest value of the standard among all the c (= c ) is smaller than NS- as Figs. and. Hoever, the standard is extremely sensitive to small changes in c (= c ) hereas the performances of NS- are stable. For other functions, NS- can obtain better results than even if the acceleration coefficients c (= c ) are varied. From these results, e can say that NS- is more effective and its parametrical dependence is not stronger than the standard. VI. CONCLUSIONS This study has proposed a ne Particle Sarm Optimization () ith topological neighborhoods; Netork- Structured Particle Sarm Optimizer considering neighborhood relationships. All particles of NS- are connected
6 Fig.. Mean gbest value ith different for -dimensional eight functions. Fixed parameters; c = c =.. σ =3for Ackley s function f and. for other all functions. Sphere function. Rosenbrock s function. 3 rd De Jong s function. th De Jong s function. Rastrigin s function. Ackley s function. Stretched V sine ave function. Grieank s function. to adjacent particles by neighborhood relation of the - dimensional netork. The directly connected particles share the information of their on best position. Each particle is updated depending on the neighborhood distance on the netork beteen it and a inner, hose function value is the best among all particles. In the simulation results, e have confirmed the accuracy, robustness and parameterdependence of and NS-, and it is clear that the overall performance of NS- is much efficient and robust. In the feature orks, e should investigate the behaviors of NS- ith various netork topologies and its relevance beteen netork structure and performance in detail. REFERENCES [] J. Kennedy and R. C. Eberhart, Particle sarm optimization, in Proc. IEEE. Int. Conf. Neural Net., pp. 9 9, 99. [] J. Kennedy, Small orlds and mega-minds: effects of neighborhood topology on particle sarm performance, in Proc. of Cong. on Evolut. Comput., pp , 999. [3] J. Kennedy and R. Mendes, Population structure and particle sarm performance, in Proc. of Cong. on Evolut. Comput., pp. 7 7,. 3
7 c=c c=c c=c c=c c=c c=c c=c c=c Fig.. Mean gbest value ith different c = c for -dimensional eight functions. Fixed parameters; =.7. σ =3for Ackley s function f and. for other all functions. Sphere function. Rosenbrock s function. 3 rd De Jong s function. th De Jong s function. Rastrigin s function. Ackley s function. Stretched V sine ave function. Grieank s function. [] R. Mendes, J. Kennedy and J. Neves, The Fully Informed Particle Sarm: Simpler, Maybe Better, in IEEE Trans. Evolut. Comput., vol., no.3, pp., June. [] S. B. Akat and V. Gazi, Particle Sarm Optimization ith Dynamic Neighborhood Topology: Three Neighborhood Strategies and Preliminary Results, in Proc. of IEEE Sarm Intelligence Symposium,. [] X. Xie, W. Zang and Z. Yang, A dissipative sarm optimization, in Proc. of Cong. on Evolut. Comput., pp.,.
Modified Particle Swarm Optimization
Modified Particle Swarm Optimization Swati Agrawal 1, R.P. Shimpi 2 1 Aerospace Engineering Department, IIT Bombay, Mumbai, India, swati.agrawal@iitb.ac.in 2 Aerospace Engineering Department, IIT Bombay,
More informationSmall World Network Based Dynamic Topology for Particle Swarm Optimization
Small World Network Based Dynamic Topology for Particle Swarm Optimization Qingxue Liu 1,2, Barend Jacobus van Wyk 1 1 Department of Electrical Engineering Tshwane University of Technology Pretoria, South
More informationSmall World Particle Swarm Optimizer for Global Optimization Problems
Small World Particle Swarm Optimizer for Global Optimization Problems Megha Vora and T.T. Mirnalinee Department of Computer Science and Engineering S.S.N College of Engineering, Anna University, Chennai,
More informationParticle Swarm Optimization
Dario Schor, M.Sc., EIT schor@ieee.org Space Systems Department Magellan Aerospace Winnipeg Winnipeg, Manitoba 1 of 34 Optimization Techniques Motivation Optimization: Where, min x F(x), subject to g(x)
More informationHybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques
Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques Nasser Sadati Abstract Particle Swarm Optimization (PSO) algorithms recently invented as intelligent optimizers with several highly
More informationOptimization of Benchmark Functions Using Artificial Bee Colony (ABC) Algorithm
IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 10 (October. 2013), V4 PP 09-14 Optimization of Benchmark Functions Using Artificial Bee Colony (ABC) Algorithm
More informationA *69>H>N6 #DJGC6A DG C<>C::G>C<,8>:C8:H /DA 'D 2:6G, ()-"&"3 -"(' ( +-" " " % '.+ % ' -0(+$,
The structure is a very important aspect in neural network design, it is not only impossible to determine an optimal structure for a given problem, it is even impossible to prove that a given structure
More informationPARTICLE SWARM OPTIMIZATION (PSO)
PARTICLE SWARM OPTIMIZATION (PSO) J. Kennedy and R. Eberhart, Particle Swarm Optimization. Proceedings of the Fourth IEEE Int. Conference on Neural Networks, 1995. A population based optimization technique
More informationEE 553 Term Project Report Particle Swarm Optimization (PSO) and PSO with Cross-over
EE Term Project Report Particle Swarm Optimization (PSO) and PSO with Cross-over Emre Uğur February, 00 Abstract In this work, Particle Swarm Optimization (PSO) method is implemented and applied to various
More informationA Hybrid Fireworks Optimization Method with Differential Evolution Operators
A Fireworks Optimization Method with Differential Evolution Operators YuJun Zheng a,, XinLi Xu a, HaiFeng Ling b a College of Computer Science & Technology, Zhejiang University of Technology, Hangzhou,
More informationHPSOM: A HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM WITH GENETIC MUTATION. Received February 2012; revised June 2012
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 5, May 2013 pp. 1919 1934 HPSOM: A HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM
More informationDS-PSO: Particle Swarm Optimization with Dynamic and Static Topologies
Bowdoin College Bowdoin Digital Commons Honors Projects Student Scholarship and Creative Work 5-2017 DS-PSO: Particle Swarm Optimization with Dynamic and Static Topologies Dominick Sanchez mingosanch@gmail.com
More informationSpeculative Evaluation in Particle Swarm Optimization
Speculative Evaluation in Particle Swarm Optimization Matthew Gardner, Andrew McNabb, and Kevin Seppi Department of Computer Science, Brigham Young University Abstract. Particle swarm optimization (PSO)
More informationInertia Weight. v i = ωv i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) The new velocity update equation:
Convergence of PSO The velocity update equation: v i = v i +φ 1 R(0,1)(p i x i )+φ 2 R(0,1)(p g x i ) for some values of φ 1 and φ 2 the velocity grows without bound can bound velocity to range [ V max,v
More informationBinary Differential Evolution Strategies
Binary Differential Evolution Strategies A.P. Engelbrecht, Member, IEEE G. Pampará Abstract Differential evolution has shown to be a very powerful, yet simple, population-based optimization approach. The
More informationHandling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization
Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,
More informationA Polar Coordinate Particle Swarm Optimiser
A Polar Coordinate Particle Swarm Optimiser Wiehann Matthysen and Andries P. Engelbrecht Department of Computer Science, University of Pretoria, South Africa engel@cs.up.ac.za Abstract The Particle Swarm
More informationKent Academic Repository
Kent Academic Repository Full text document (pdf) Citation for published version Iqbal, Musaddar and Freitas, Alex A. and Johnson, Colin G. (2005) Varying the Topology and Probability of Re-Initialization
More informationOptimized Algorithm for Particle Swarm Optimization
Optimized Algorithm for Particle Swarm Optimization Fuzhang Zhao Abstract Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization
More informationParticle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm
Particle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm Oğuz Altun Department of Computer Engineering Yildiz Technical University Istanbul, Turkey oaltun@yildiz.edu.tr
More informationEffect of the PSO Topologies on the Performance of the PSO-ELM
2012 Brazilian Symposium on Neural Networks Effect of the PSO Topologies on the Performance of the PSO-ELM Elliackin M. N. Figueiredo and Teresa B. Ludermir Center of Informatics Federal University of
More informationIMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE
IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE Fang Wang, and Yuhui Qiu Intelligent Software and Software Engineering Laboratory, Southwest-China Normal University,
More informationLECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO BACKGROUND: REYNOLDS BOIDS Reynolds created a model of coordinated animal
More informationGREEN-PSO: Conserving Function Evaluations in Particle Swarm Optimization
GREEN-PSO: Conserving Function Evaluations in Particle Swarm Optimization Stephen M. Majercik 1 1 Department of Computer Science, Bowdoin College, Brunswick, Maine, USA smajerci@bowdoin.edu Keywords: Abstract:
More information1 Lab + Hwk 5: Particle Swarm Optimization
1 Lab + Hwk 5: Particle Swarm Optimization This laboratory requires the following equipment: C programming tools (gcc, make), already installed in GR B001 Webots simulation software Webots User Guide Webots
More informationUnidimensional Search for solving continuous high-dimensional optimization problems
2009 Ninth International Conference on Intelligent Systems Design and Applications Unidimensional Search for solving continuous high-dimensional optimization problems Vincent Gardeux, Rachid Chelouah,
More informationReconfiguration Optimization for Loss Reduction in Distribution Networks using Hybrid PSO algorithm and Fuzzy logic
Bulletin of Environment, Pharmacology and Life Sciences Bull. Env. Pharmacol. Life Sci., Vol 4 [9] August 2015: 115-120 2015 Academy for Environment and Life Sciences, India Online ISSN 2277-1808 Journal
More informationAn improved PID neural network controller for long time delay systems using particle swarm optimization algorithm
An improved PID neural network controller for long time delay systems using particle swarm optimization algorithm A. Lari, A. Khosravi and A. Alfi Faculty of Electrical and Computer Engineering, Noushirvani
More informationCooperative Coevolution using The Brain Storm Optimization Algorithm
Cooperative Coevolution using The Brain Storm Optimization Algorithm Mohammed El-Abd Electrical and Computer Engineering Department American University of Kuwait Email: melabd@auk.edu.kw Abstract The Brain
More informationWhat Makes A Successful Society?
What Makes A Successful Society? Experiments With Population Topologies in Particle Swarms Rui Mendes and José Neves Departamento de Informática Universidade do Minho Portugal Abstract. Previous studies
More information150 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 14, NO. 1, FEBRUARY X/$26.00 c 2010 IEEE
150 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 14, NO. 1, FEBRUARY 2010 Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology Xiaodong Li, Senior Member, IEEE Abstract
More informationTraffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization
Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,
More informationAdaptative Clustering Particle Swarm Optimization
Adaptative Clustering Particle Swarm Optimization Salomão S. Madeiro, Carmelo J. A. Bastos-Filho, Member, IEEE, and Fernando B. Lima Neto, Senior Member, IEEE, Elliackin M. N. Figueiredo Abstract The performance
More informationTracking Changing Extrema with Particle Swarm Optimizer
Tracking Changing Extrema with Particle Swarm Optimizer Anthony Carlisle Department of Mathematical and Computer Sciences, Huntingdon College antho@huntingdon.edu Abstract The modification of the Particle
More informationPopulation Structure and Particle Swarm Performance
Population Structure and Particle Swarm Performance James Kennedy Bureau of Labor Statistics Washington, DC Kennedy_Jim@bls.gov Rui Mendes Universidade do Minho Braga, Portugal rui@omega.di.uminho.pt Abstract:
More informationConstrained Single-Objective Optimization Using Particle Swarm Optimization
2006 IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 2006 Constrained Single-Objective Optimization Using Particle Swarm Optimization Karin
More informationAn Island Based Hybrid Evolutionary Algorithm for Optimization
An Island Based Hybrid Evolutionary Algorithm for Optimization Changhe Li and Shengxiang Yang Department of Computer Science, University of Leicester University Road, Leicester LE1 7RH, UK {cl160,s.yang}@mcs.le.ac.uk
More informationParticle Swarm Optimizer for Finding Robust Optima. J.K. Vis
Particle Swarm Optimizer for Finding Robust Optima J.K. Vis jvis@liacs.nl June 23, 2009 ABSTRACT Many real-world processes are subject to uncertainties and noise. Robust Optimization methods seek to obtain
More informationFDR PSO-Based Optimization for Non-smooth Functions
M. Anitha, et al. / International Energy Journal 0 (009) 37-44 37 www.serd.ait.ac.th/reric FDR PSO-Based Optimization for n-smooth Functions M. Anitha*, S. Subramanian* and R. Gnanadass + Abstract In this
More informationA Gaussian Firefly Algorithm
A Gaussian Firefly Algorithm Sh. M. Farahani, A. A. Abshouri, B. Nasiri and M. R. Meybodi Abstract Firefly algorithm is one of the evolutionary optimization algorithms, and is inspired by fireflies behavior
More informationModified Particle Swarm Optimization with Novel Modulated Inertia for Velocity Update
Modified Particle Swarm Optimization with Novel Modulated Inertia for Velocity Update Abdul Hadi Hamdan #1, Fazida Hanim Hashim #2, Abdullah Zawawi Mohamed *3, W. M. Diyana W. Zaki #4, Aini Hussain #5
More informationOptimization Using Particle Swarms with Near Neighbor Interactions
Optimization Using Particle Swarms with Near Neighbor Interactions Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri Mohan, and Lisa Ann Osadciw Department of Electrical Engineering and Computer Science
More informationMobile Robot Path Planning in Static Environments using Particle Swarm Optimization
Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization M. Shahab Alam, M. Usman Rafique, and M. Umer Khan Abstract Motion planning is a key element of robotics since it empowers
More informationThree-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization
Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization Lana Dalawr Jalal Abstract This paper addresses the problem of offline path planning for
More informationDefining a Standard for Particle Swarm Optimization
Defining a Standard for Particle Swarm Optimization Daniel Bratton Department of Computing Goldsmiths College University of London London, UK Email: dbratton@gmail.com James Kennedy US Bureau of Labor
More information1 Lab 5: Particle Swarm Optimization
1 Lab 5: Particle Swarm Optimization This laboratory requires the following: (The development tools are installed in GR B0 01 already): C development tools (gcc, make, etc.) Webots simulation software
More informationDiscrete Particle Swarm Optimization for TSP based on Neighborhood
Journal of Computational Information Systems 6:0 (200) 3407-344 Available at http://www.jofcis.com Discrete Particle Swarm Optimization for TSP based on Neighborhood Huilian FAN School of Mathematics and
More informationComparing lbest PSO Niching algorithms Using Different Position Update Rules
WCCI 21 IEEE World Congress on Computational Intelligence July, 18-23, 21 - CCIB, Barcelona, Spain CEC IEEE Comparing lbest PSO Niching algorithms Using Different Position Update Rules Xiaodong Li and
More informationResearch Article A Dynamic Multistage Hybrid Swarm Intelligence Optimization Algorithm for Function Optimization
Discrete Dynamics in Nature and Society Volume 212, Article ID 7864, 22 pages doi:1.11/212/7864 Research Article A Dynamic Multistage Hybrid Swarm Intelligence Optimization Algorithm for Function Optimization
More informationIndividual Parameter Selection Strategy for Particle Swarm Optimization
Individual Parameter Selection Strategy for Xingjuan Cai, Zhihua Cui, Jianchao Zeng and Ying Tan Division of System Simulation and Computer Application, Taiyuan University of Science and Technology P.R.China
More information1 Lab + Hwk 5: Particle Swarm Optimization
1 Lab + Hwk 5: Particle Swarm Optimization This laboratory requires the following equipment: C programming tools (gcc, make). Webots simulation software. Webots User Guide Webots Reference Manual. The
More informationParticle swarm optimization for mobile network design
Particle swarm optimization for mobile network design Ayman A. El-Saleh 1,2a), Mahamod Ismail 1, R. Viknesh 2, C. C. Mark 2, and M. L. Chan 2 1 Department of Electrical, Electronics, and Systems Engineering,
More informationAutomatic differentiation based for particle swarm optimization steepest descent direction
International Journal of Advances in Intelligent Informatics ISSN: 2442-6571 Vol 1, No 2, July 2015, pp. 90-97 90 Automatic differentiation based for particle swarm optimization steepest descent direction
More informationA MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM
A MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM BAHAREH NAKISA, MOHAMMAD NAIM RASTGOO, MOHAMMAD FAIDZUL NASRUDIN, MOHD ZAKREE AHMAD NAZRI Department of Computer
More informationA Comparative Analysis on the Performance of Particle Swarm Optimization and Artificial Immune Systems for Mathematical Test Functions.
Australian Journal of Basic and Applied Sciences 3(4): 4344-4350 2009 ISSN 1991-8178 A Comparative Analysis on the Performance of Particle Swarm Optimization and Artificial Immune Systems for Mathematical
More informationSINCE PARTICLE swarm optimization (PSO) was introduced
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL., NO. 5, OCTOBER 9 Frankenstein s PSO: A Composite Particle Swarm Optimization Algorithm Marco A. Montes de Oca, Thomas Stützle, Mauro Birattari, Member,
More informationThe Pennsylvania State University. The Graduate School. Department of Electrical Engineering COMPARISON OF CAT SWARM OPTIMIZATION WITH PARTICLE SWARM
The Pennsylvania State University The Graduate School Department of Electrical Engineering COMPARISON OF CAT SWARM OPTIMIZATION WITH PARTICLE SWARM OPTIMIZATION FOR IIR SYSTEM IDENTIFICATION A Thesis in
More informationThe movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat
An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult
More informationDiscrete Multi-Valued Particle Swarm Optimization
Discrete Multi-d Particle Swarm Optimization Jim Pugh and Alcherio Martinoli Swarm-Intelligent Systems Group École Polytechnique Fédérale de Lausanne 05 Lausanne, Switzerland Email: {jim.pugh,alcherio.martinoli}@epfl.ch
More informationQUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION
International Journal of Computer Engineering and Applications, Volume VIII, Issue I, Part I, October 14 QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION Shradha Chawla 1, Vivek Panwar 2 1 Department
More informationA Multiobjective Memetic Algorithm Based on Particle Swarm Optimization
A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization Dr. Liu Dasheng James Cook University, Singapore / 48 Outline of Talk. Particle Swam Optimization 2. Multiobjective Particle Swarm
More informationA Robust Method of Facial Feature Tracking for Moving Images
A Robust Method of Facial Feature Tracking for Moving Images Yuka Nomura* Graduate School of Interdisciplinary Information Studies, The University of Tokyo Takayuki Itoh Graduate School of Humanitics and
More informationThe Prediction of Real estate Price Index based on Improved Neural Network Algorithm
, pp.0-5 http://dx.doi.org/0.457/astl.05.8.03 The Prediction of Real estate Price Index based on Improved Neural Netor Algorithm Huan Ma, Ming Chen and Jianei Zhang Softare Engineering College, Zhengzhou
More informationBenchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization
Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization K. Tang 1, X. Yao 1, 2, P. N. Suganthan 3, C. MacNish 4, Y. P. Chen 5, C. M. Chen 5, Z. Yang 1 1
More informationTHREE PHASE FAULT DIAGNOSIS BASED ON RBF NEURAL NETWORK OPTIMIZED BY PSO ALGORITHM
THREE PHASE FAULT DIAGNOSIS BASED ON RBF NEURAL NETWORK OPTIMIZED BY PSO ALGORITHM M. Sivakumar 1 and R. M. S. Parvathi 2 1 Anna University, Tamilnadu, India 2 Sengunthar College of Engineering, Tamilnadu,
More informationAn Algorithm for the Welding Torch Weaving Control of Arc Welding Robot
http://dx.doi.org/0.5755/j0.eee.2.2.599 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 392-25, VOL. 2, NO. 2, 205 An Algorithm for the Welding Torch Weaving Control of Arc Welding Robot Wen-liang Zhu, Fu-sheng Ni
More informationA NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION
A NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION Manjeet Singh 1, Divesh Thareja 2 1 Department of Electrical and Electronics Engineering, Assistant Professor, HCTM Technical
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle Frankenstein s PSO: An Engineered Composite Particle Swarm Optimization Algorithm
More informationIN RECENT YEARS, particle swarm optimization (PSO)
440 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 10, NO. 4, AUGUST 2006 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation Daniel Parrott and Xiaodong Li, Member,
More informationKEYWORDS: Mobile Ad hoc Networks (MANETs), Swarm Intelligence, Particle Swarm Optimization (PSO), Multi Point Relay (MPR), Throughput.
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY APPLICATION OF SWARM INTELLIGENCE PSO TECHNIQUE FOR ANALYSIS OF MULTIMEDIA TRAFFIC AND QOS PARAMETERS USING OPTIMIZED LINK STATE
More informationParticle Swarm Optimization in Scilab ver 0.1-7
Particle Swarm Optimization in Scilab ver 0.1-7 S. SALMON, Research engineer and PhD. student at M3M - UTBM Abstract This document introduces the Particle Swarm Optimization (PSO) in Scilab. The PSO is
More informationApplication of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3673 3677 Advanced in Control Engineeringand Information Science Application of Improved Discrete Particle Swarm Optimization in
More informationDesign optimization method for Francis turbine
IOP Conference Series: Earth and Environmental Science OPEN ACCESS Design optimization method for Francis turbine To cite this article: H Kawajiri et al 2014 IOP Conf. Ser.: Earth Environ. Sci. 22 012026
More informationCell-to-switch assignment in. cellular networks. barebones particle swarm optimization
Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationAutomatic Deployment and Formation Control of Decentralized Multi-Agent Networks
Automatic Deployment and Formation Control of Decentralized Multi-Agent Netorks Brian S. Smith, Magnus Egerstedt, and Ayanna Hoard Abstract Novel tools are needed to deploy multi-agent netorks in applications
More informationAdaptive Spiral Optimization Algorithm for Benchmark Problems
Bilecik Şeyh Edebali Üniversitesi Fen Bilimleri Dergisi, Cilt:, Sayı:, 6 ISSN: -77 (http://edergi.bilecik.edu.tr/index.php/fbd) Araştırma Makalesi/Research Article Adaptive Spiral Optimization Algorithm
More informationAssessing Particle Swarm Optimizers Using Network Science Metrics
Assessing Particle Swarm Optimizers Using Network Science Metrics Marcos A. C. Oliveira-Júnior, Carmelo J. A. Bastos-Filho and Ronaldo Menezes Abstract Particle Swarm Optimizers (PSOs) have been widely
More informationAdaptive Particle Swarm Optimization (APSO) for multimodal function optimization
Adaptive Particle Swarm Optimization (APSO) for multimodal function optimization Md. Sakhawat Hossen 1, Fazle Rabbi 2 Md. Mainur Rahman 3 1 The Royal Institute of Technology (KTH) Stockholm, Sweden 1 hossen@kth.se
More informationExperimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization
Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical
More informationOPTIMUM CAPACITY ALLOCATION OF DISTRIBUTED GENERATION UNITS USING PARALLEL PSO USING MESSAGE PASSING INTERFACE
OPTIMUM CAPACITY ALLOCATION OF DISTRIBUTED GENERATION UNITS USING PARALLEL PSO USING MESSAGE PASSING INTERFACE Rosamma Thomas 1, Jino M Pattery 2, Surumi Hassainar 3 1 M.Tech Student, Electrical and Electronics,
More informationSimulating Particle Swarm Optimization Algorithm to Estimate Likelihood Function of ARMA(1, 1) Model
Journal of Mathematics and System Science 5 (2015) 399-410 doi: 10.17265/2159-5291/2015.10.002 D DAVID PUBLISHING Simulating Particle Swarm Optimization Algorithm to Estimate Likelihood Function of ARMA(1,
More informationAn Intelligent Mesh Based Multicast Routing Algorithm for MANETs using Particle Swarm Optimization
214 An Intelligent Mesh Based Multicast Routing Algorithm for MANETs using Particle Swarm Optimization E. Baburaj 1, and V. Vasudevan 2 1. Research Scholar, Anna University 2. Professor, Department of
More informationA RANDOM SYNCHRONOUS-ASYNCHRONOUS PARTICLE SWARM OPTIMIZATION ALGORITHM WITH A NEW ITERATION STRATEGY
A RANDOM SYNCHRONOUS-ASYNCHRONOUS PARTICLE SWARM OPTIMIZATION ALORITHM WITH A NEW ITERATION STRATEY Nor Azlina Ab Aziz 1,2, Shahdan Sudin 3, Marizan Mubin 1, Sophan Wahyudi Nawawi 3 and Zuwairie Ibrahim
More informationParticle Swarm Optimization for ILP Model Based Scheduling
Particle Swarm Optimization for ILP Model Based Scheduling Shilpa KC, C LakshmiNarayana Abstract This paper focus on the optimal solution to the time constraint scheduling problem with the Integer Linear
More informationDevelopment of Redundant Robot Simulator for Avoiding Arbitrary Obstacles Based on Semi-Analytical Method of Solving Inverse Kinematics
Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems San Diego, CA, USA, Oct 29 - Nov 2, 2007 ThC2.1 Development of Redundant Robot Simulator for Avoiding Arbitrary
More informationImproving Tree-Based Classification Rules Using a Particle Swarm Optimization
Improving Tree-Based Classification Rules Using a Particle Swarm Optimization Chi-Hyuck Jun *, Yun-Ju Cho, and Hyeseon Lee Department of Industrial and Management Engineering Pohang University of Science
More informationAdaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization
Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization Xiaodong Li School of Computer Science and Information Technology RMIT University,
More informationA Native Approach to Cell to Switch Assignment Using Firefly Algorithm
International Journal of Engineering Inventions ISSN: 2278-7461, www.ijeijournal.com Volume 1, Issue 2(September 2012) PP: 17-22 A Native Approach to Cell to Switch Assignment Using Firefly Algorithm Apoorva
More informationInternational Conference on Modeling and SimulationCoimbatore, August 2007
International Conference on Modeling and SimulationCoimbatore, 27-29 August 2007 OPTIMIZATION OF FLOWSHOP SCHEDULING WITH FUZZY DUE DATES USING A HYBRID EVOLUTIONARY ALGORITHM M.S.N.Kiran Kumara, B.B.Biswalb,
More informationMulti swarm optimization algorithm with adaptive connectivity degree
Multi swarm optimization algorithm with adaptive connectivity degree R. Vafashoar, M. R. Meybodi Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University
More informationFPGA Implementation of Parallel Particle Swarm Optimization Algorithm and Compared with Genetic Algorithm
FPGA Implementation of Parallel Particle Swarm Optimization Algorithm and Compared with Genetic Algorithm BEN AMEUR Mohamed sadek Laboratory of Microelectronic, university of Monastir, Monastir, Tunisia
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationThesis Submitted for the degree of. Doctor of Philosophy. at the University of Leicester. Changhe Li. Department of Computer Science
Particle Swarm Optimization in Stationary and Dynamic Environments Thesis Submitted for the degree of Doctor of Philosophy at the University of Leicester by Changhe Li Department of Computer Science University
More informationVideo Seamless Splicing Method Based on SURF Algorithm and Harris Corner Points Detection
Vol13 (Softech 016), pp138-14 http://dxdoiorg/101457/astl016137 Video Seamless Splicing Method Based on SURF Algorithm and Harris Corner Points Detection Dong Jing 1, Chen Dong, Jiang Shuen 3 1 College
More informationFeeder Reconfiguration Using Binary Coding Particle Swarm Optimization
488 International Journal Wu-Chang of Control, Wu Automation, and Men-Shen and Systems, Tsai vol. 6, no. 4, pp. 488-494, August 2008 Feeder Reconfiguration Using Binary Coding Particle Swarm Optimization
More informationPart II. Computational Intelligence Algorithms
Part II Computational Intelligence Algorithms 126 Chapter 5 Population-based Single-objective Algorithms One bee makes no swarm. French proverb This chapter provides an overview of two CI algorithms that
More informationParticle Swarm Optimization
Particle Swarm Optimization Gonçalo Pereira INESC-ID and Instituto Superior Técnico Porto Salvo, Portugal gpereira@gaips.inesc-id.pt April 15, 2011 1 What is it? Particle Swarm Optimization is an algorithm
More informationEffectual Multiprocessor Scheduling Based on Stochastic Optimization Technique
Effectual Multiprocessor Scheduling Based on Stochastic Optimization Technique A.Gowthaman 1.Nithiyanandham 2 G Student [VLSI], Dept. of ECE, Sathyamabama University,Chennai, Tamil Nadu, India 1 G Student
More informationA REAL-TIME REGISTRATION METHOD OF AUGMENTED REALITY BASED ON SURF AND OPTICAL FLOW
A REAL-TIME REGISTRATION METHOD OF AUGMENTED REALITY BASED ON SURF AND OPTICAL FLOW HONGBO LI, MING QI AND 3 YU WU,, 3 Institute of Web Intelligence, Chongqing University of Posts and Telecommunications,
More information