Location of Repository

Orthogonal learning particle swarm optimization

By Z-H. Zhan, J. Zhang, Y. Li and Y-H. Shi


Particle swarm optimization (PSO) relies on its\ud learning strategy to guide its search direction. Traditionally,\ud each particle utilizes its historical best experience and its neighborhood’s\ud best experience through linear summation. Such a\ud learning strategy is easy to use, but is inefficient when searching\ud in complex problem spaces. Hence, designing learning strategies\ud that can utilize previous search information (experience) more\ud efficiently has become one of the most salient and active PSO\ud research topics. In this paper, we proposes an orthogonal learning\ud (OL) strategy for PSO to discover more useful information that\ud lies in the above two experiences via orthogonal experimental\ud design. We name this PSO as orthogonal learning particle swarm\ud optimization (OLPSO). The OL strategy can guide particles to\ud fly in better directions by constructing a much promising and\ud efficient exemplar. The OL strategy can be applied to PSO with\ud any topological structure. In this paper, it is applied to both global\ud and local versions of PSO, yielding the OLPSO-G and OLPSOL\ud algorithms, respectively. This new learning strategy and the\ud new algorithms are tested on a set of 16 benchmark functions, and\ud are compared with other PSO algorithms and some state of the\ud art evolutionary algorithms. The experimental results illustrate\ud the effectiveness and efficiency of the proposed learning strategy\ud and algorithms. The comparisons show that OLPSO significantly\ud improves the performance of PSO, offering faster global convergence,\ud higher solution quality, and stronger robustness

Publisher: IEEE
Year: 2010
OAI identifier: oai:eprints.gla.ac.uk:44801
Provided by: Enlighten

Suggested articles



  1. (2002). A computationally efficient evolutionary algorithm for real-parameter optimization,” doi
  2. (2004). A cooperative approach to particle swarm optimization,” doi
  3. (2004). A hybrid of genetic algorithm and particle swarm optimization for recurrent network design,” doi
  4. (1998). A modified particle swarm optimizer,” in doi
  5. (1995). A new optimizer using particle swarm theory,” in doi
  6. (2002). A niching particle swarm optimizer,” in doi
  7. (2006). A note on the extended Rosenbrock function,” doi
  8. (2009). Adaptive differential evolution with optional external archive,” doi
  9. (2009). Adaptive particle swarm optimization,” doi
  10. (2004). An approach to multimodal biomedical image registration utilizing particle swarm optimization,” doi
  11. (2006). An enhanced genetic algorithm with orthogonal design,” in doi
  12. (2006). An investigation into mutation operators for particle swarm optimization,” in doi
  13. (1999). An orthogonal genetic algorithm for multimedia multicast routing,” doi
  14. (2001). An orthogonal genetic algorithm with quantization for global numerical optimization,” doi
  15. (2004). An orthogonal simulated annealing algorithm for large floorplanning problems,” doi
  16. (1975). Chinese Acad. Sci., Orthogonal Design (in Chinese).
  17. (2000). Comparing inertia weights and constriction factors in particle swarm optimization,” in doi
  18. (1998). Comparison between genetic algorithms and particle swarm optimization,” in doi
  19. (2001). Completely derandomized selfadaptation in evolution strategies,” doi
  20. (2006). Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” doi
  21. (2005). Dynamic multi-swarm particle swarm optimizer,” in doi
  22. (2009). Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimization,” doi
  23. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. doi
  24. (1999). Evolutionary programming made faster,” doi
  25. (2003). Fitness-distance-ratio based particle swarm optimization,” in doi
  26. (2004). Handling multiple objectives with particle swarm optimization,” doi
  27. (2004). Hybrid estimation of distribution algorithm for global optimization,” doi
  28. (2001). Hybrid particle swarm optimizer with breeding and subpopulations,” in
  29. (2004). Intelligent evolutionary algorithms for large parameter optimization problems,” doi
  30. (2004). Learning to play games using a PSO-based competitive learning approach,” doi
  31. (2006). Locating and tracking multiple dynamic optima by a particle swarm model using speciation,” doi
  32. (2007). Locating multiple optima using particle swarm optimization,” doi
  33. (2002). Multiobjective optimization using dynamic neighborhood particle swarm optimization,” in doi
  34. (2006). Neighborhood topologies in fully informed and best-of-neighborhood particle swarm,” doi
  35. (2008). Novel orthogonal momentum-type particle swarm optimization applied to solve large parameter optimization problems,” doi
  36. (2004). On the computation of all global minimizers through particle swarm optimization,” doi
  37. (2008). OPSO: Orthogonal particle swarm optimization and its application to task assignment problems,” doi
  38. (2008). Orthogonal methods based ant colony search for solving continuous optimization problems,” doi
  39. (2004). OSA: Orthogonal simulated annealing algorithm and its application to designing mixed H2/H8 optimal controllers,” doi
  40. (2005). Particle swarm optimization approaches to coevolve strategies for the iterated prisoner’s dilemma,” doi
  41. (1995). Particle swarm optimization,” in doi
  42. (2007). Particle swarm optimization: An introduction and its recent developments,” in doi
  43. (2008). Particle swarm optimization: Basic concepts, variants and applications in power system,” doi
  44. (2001). Particle swarm optimization: Developments, applications and resources,” in doi
  45. (1999). Particle swarm optimizer with neighborhood operator,” in doi
  46. (2005). Performance evaluation of an advanced local search evolutionary algorithm,” in doi
  47. (2002). Population structure and particle swarm performance,” in doi
  48. (2005). Problem definitions and evaluation criteria for the CEC
  49. (2004). Recent advances in particle swarm,” in doi
  50. (2004). Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients,” doi
  51. (1999). Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance,” in doi
  52. (2000). Stereotyping: Improving particle swarm performance with cluster analysis,” in doi
  53. (2001). Swarm Intelligence. doi
  54. (2004). The fully informed particle swarm: Simpler, maybe better,” doi
  55. (2002). The particle swarm-explosion, stability and convergence in a multidimensional complex space,” doi
  56. (1999). The swarm and the queen: Toward a deterministic and adaptive particle swarm optimization,” in doi
  57. (1998). Using selection to improve particle swarm optimization,” in doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.