Reverse Search Particle Swarm Optimization to Deal with Dynamic Optimization Problems

Abstract:

Multiswarm approaches are used in many literatures to deal with dynamic optimization problems (DOPs). Each swarm tries to find promising areas where usually peaks lie and many good results have been obtained. However, steep peaks are difficult to be found with multiswarm approaches , which hinders the performance of the algorithm to be improved furtherly. Aiming at the bottleneck, the paper introduces the idea of sequential niche technique to traditional multiswarm approach and thus proposes a novel algorithm called reverse space search multiswarm particle swarm optimization (RSPSO) for DOPs. RSPSO uses the information of the peaks found by coarse search of traditional multiswarm approach to modify the original fitness function. A newly generated subswarm - reverse search subswarm evolves with the modified fitness function, at the same time, other subswarms using traditional mltiswarm approach still evolve. Two kinds of subswarm evolve in cooperation. Reverse search subswarm tends to find much steeper peak and so more promising area where peaks lie is explored. Elaborated experiments on MPB show the introduction of reverse search enhances the ability of finding peaks , the performance of RSPSO significantly outperforms traditional multiswarm approaches and it has better robustness to adapt to dynamic environment with wider-range change severity.

• Periodical: Applied Mechanics and Materials (Volumes 571-572)
• Pages: 245-251
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.571-572.245
• Online since: June 2014
• Authors: Li Chen*, Wei Jiang Wang, Lei Yao
• Keywords: Dynamic optimization, Multiswarm Particle Swarm Optimization, Sequential Niche Technique

References

[1] Kennedy J, Eberhart R. Swarm intelligence. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2001).

[2] Branke J. Evolutionary Optimization in Dynamic Environments. Boston: Kluwer Academic Publishers (2002).

[3] Cobb H. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA (1990).

DOI: 10.21236/ada229159

[4] Branke J. Memory enhanced evolutionary algorithms for changing optimization problems. Proc. 1999 Congr. Evol. Comput (1999), p.1875.

[5] Pan G, Dou Q, Liu X. Performance of two improved particle swarm optimization in dynamic optimization environments. Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (2006), p.1024-p.1028.

DOI: 10.1109/isda.2006.253752

[6] Esquivel S C, Coello C. Particle swarm optimization in non-stationary environments. Proceedings of Advances in Artificial Intelligence–IBERAMIA 2004 (2004), p.757.

DOI: 10.1007/978-3-540-30498-2_76

[7] Janson S, Middendorf M. Genetic Program. Evolvable Mach Vol. 7 (2006), p.329.

[8] Mahfoud S W. A comparison of parallel and sequential niching methods. Proceedings of the sixth international conference on genetic algorithms, Morgan Kaufmann (1995), p.136.

[9] Yang S, Li C. IEEE Transactions on Evolutionary Computation. Vol. 14 (2010), p.959.

[10] Parrott D, Li X. IEEE Trans. Evol. Comput. Vol. 10 (2006), p.440.

[11] Beasley D, Bull D R, Martin R. Evolutionary Computation. Vol. 1(1993), p.101.

[12] Parsopoulos K E, Plagianakos V P, Magoulas G D, Vrahatis M N. Stretching technique for obtaining global minimizers through particle swarm optimization. Proceedings of the Particle Swarm Optimization Workshop, Indianapolis(2001), p.22.

DOI: 10.1007/978-1-4613-0279-7_28

[13] Bird S, Li X. Using regression to improve local convergence. Proceddings of Congress on Evolutionary Computation (2007), p.592.

DOI: 10.1109/cec.2007.4424524

[14] Blackwell T M, Branke J. IEEE Transactions on Evolutionary Computation. Vol. 10(2006), p.459.