Xiaodong Li
ABSTRACT
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several proven useful techniques. In particular, SPSO is shown to be able to adapt to a series of dynamic test cases with varying number of peaks (assuming maximization). Inspired by the concept of quantum swarms, this paper also proposes a particle diversification method that promotes particle diversity within each converged species. Our results over the moving peaks benchmark test functions suggest that SPSO incorporating this particle diversification method can greatly improve its adaptability hence optima tracking performance.
- J. Angeline. Tracking extrema in dynamic environments. In Proc. of the Evolutionary Programming VI, pages 335--345, Indianapolis, 1997. Berlin: Springer-Verlag.]] Google Scholar
Digital Library
- T. Back. On the behaviour of evolutionary algorithms in dynamic environments. In Proc. of International Conference on Evolutionary Computation, pages 446--551. NJ: IEEE Press, 1998.]] Google ScholarDigital Library
- T. Blackwell and P. Bentley. Dynamic search with charged swarms. In Proc. the Workshop on Evolutionary Algorithms Dynamic Optimization Problems (EvoDOP-2003), pages 19--26, 2002.]]Google Scholar
- T. Blackwell and J. Branke. Multi-swarm optimization in dynamic environments. In LNCS, No. 3005, Proc. of Applications of Evolutionary Computing: EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoISAP, EvoMUSART, and EvoSTOC, pages 489--500, 2004.]]Google Scholar
- T. Blackwell and J. Branke. Multi-swarms, exclusion, and anti-convergence in dynamic environments. IEEE Transactions on Evolutionary Computation, to appear.]]Google Scholar
- J. Branke. Memory enhanced evolutionary algorithms for changing optimization problems. In Proc. Congress on Evolutionary Computation CEC'99, pages 1875--1882, 1999.]]Google ScholarCross Ref
- J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, Norwell, MA, 2002.]] Google ScholarDigital Library
- J. Branke, E. Salihoglu, and S. Uyar. Towards an analysis of dynamic environments. In Genetic and Evolutionary Computation Conference, pages 1433--1439. ACM, 2005.]] Google ScholarDigital Library
- J. Branke and H. Schmeck. Designing evolutionary algorithms for dynamic optimization problems. In S. Tsutsui and A. Ghosh, editors, Theory and Application of Evolutionary Computation: Recent Trends, pages 239--262. Springer, 2002.]] Google ScholarDigital Library
- A. Carlisle and G. Dozier. Adapting particle swarm optimization to dynamic environments. In Proc. the International Conference on Artificial Intelligence (ICAI2000), pages 429--434, 2000.]]Google Scholar
- A. Carlisle and G. Dozier. Tracking changing extrema with adaptive particle swarm optimizer. In Proc. World Automation Cong., pages 265--270, Orlando FL USA, 2002.]]Google ScholarCross Ref
- M. Clerc and J. Kennedy. The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput., 6:58--73, Feb. 2002.]]Google ScholarDigital Library
- R. C. Eberhart and Y. Shi. Tracking and optimizing dynamic systems with particle swarms. In Proc. the 2001 Congress on Evolutionary Computation CEC2001, pages 94--100. IEEE Press, 27-30 May 2001.]]Google ScholarCross Ref
- X. Hu and R. Eberhart. Adaptive particle swarm optimisation: detection and response to dynamic systems. In Proc. Congress on Evolutionary Computation, pages 1666--1670, 2002.]] Google ScholarDigital Library
- S. Janson and M. Middendorf. A hierarchical particle swarm optimizer for dynamic optimization problems. In G. Raidl, editor, Applications of Evolutionary Computing, LNCS (3005), pages 513--524. Springer, 2004.]]Google ScholarCross Ref
- Y. Jin and J. Branke. Evolutionary optimization in uncertain environments - a survey. IEEE Trans. Evol. Comput., 9:303--317, 2005.]] Google ScholarDigital Library
- J. Kennedy and R. Eberhart. Swarm Intelligence. Morgan Kaufmann, 2001.]] Google ScholarDigital Library
- J.-P. Li, M. E. Balazs, G. T. Parks, and P. J. Clarkson. A species conserving genetic algorithm for multimodal function optimization. Evol. Comput., 10(3):207--234, 2002.]] Google ScholarDigital Library
- X. Li. Adaptively choosing neighbourhood bests using species in a particle swarm optimizer for multimodal function optimization. In K. Deb, editor, Proc. of Genetic and Evolutionary Computation Conference 2004(LNCS 3102), pages 105--116, 2004.]]Google Scholar
- D. Parrott and X. Li. A particle swarm model for tacking multiple peaks in a dynamic environment using speciation. In Proc. of the 2004 Congress on Evolutionary Computation, pages 98--103, 2004.]]Google Scholar
- A. Petrowski. A clearing procedure as a niching method for genetic algorithms. In Proc. of the 3rd IEEE International Conference on Evolutionary Computation, pages 798--803, 1996.]]Google ScholarCross Ref
- R. Ursem. Multinational GAs: Multimodal optimization techniques in dynamic environments. In D. Whitley, editor, Proc. Congress on Evolutionary Computation, pages 1666--1670, 2002.]]Google Scholar
Index Terms
- Particle swarm with speciation and adaptation in a dynamic environment
Recommendations
Locating and tracking multiple dynamic optima by a particle swarm model using speciation
This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighborhood best values for solving multimodal optimization problems and for tracking multiple optima in a dynamic environment. In the proposed ...
Center particle swarm optimization
Center particle swarm optimization algorithm (CenterPSO) is proposed where a center particle is incorporated into linearly decreasing weight particle swarm optimization (LDWPSO). Unlike other ordinary particles in LDWPSO, the center particle has no ...
A theoretical and empirical analysis of convergence related particle swarm optimization
In this paper an extensive theoretical and empirical analysis of recently introduced Particle Swarm Optimization algorithm with Convergence Related parameters (CR-PSO) is presented. The convergence of the classical PSO algorithm is addressed in detail. ...
Comments