Memetic Fitness Euclidean-Distance Particle Swarm Optimization for Multi-modal Optimization

  • J. J. Liang
  • Bo Yang Qu
  • Song Tao Ma
  • Ponnuthurai Nagaratnam Suganthan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6840)

Abstract

In recent decades, solving multi-modal optimization problem has attracted many researchers attention in evolutionary computation community. Multi-modal optimization refers to locating not only one optimum but also the entire set of optima in the search space. To locate multiple optima in parallel, many niching techniques are proposed and incorporated into evolutionary algorithms in literature. In this paper, a local search technique is proposed and integrated with the existing Fitness Euclidean-distance Ratio PSO (FER-PSO) to enhance its fine search ability or the ability to identify multiple optima. The algorithm is tested on 8 commonly used benchmark functions and compared with the original FER-PSO as well as a number of multi-modal optimization algorithms in literature. The experimental results suggest that the proposed technique not only increases the probability of finding both global and local optima but also speeds up the searching process to reduce the average number of function evaluations.

Keywords

evolutionary algorithm multi-modal optimization particle swarm optimization niching 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mahfoud, S.W.: Niching Methods for Genetic Algorithms, Ph.D. dissertation, Urbana, IL, USA (1995), http://citeseer.ist.psu.edu/mahfoud95niching.html
  2. 2.
    Koper, K., Wysession, M.: Multimodal Function Optimization with a Niching Genetic Algorithm: A Seis-mological Example. Bulletin of Seismological Society of America 89, 978–988 (1999)Google Scholar
  3. 3.
    De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. dissertation, University of Michigan (1975)Google Scholar
  4. 4.
    Mahfoud, S.W.: Crowding and Preselection Revisited. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol. 2, pp. 27–36 (1992)Google Scholar
  5. 5.
    Harik, G.R.: Finding Multimodal Solutions Using Restricted Tournament Selection. In: Proc. of the Sixth International Conference on Genetic Algorithms. Morgan Kaufmann, San FranciscoGoogle Scholar
  6. 6.
    Pétrowski, A.: A Clearing Procedure as a Niching Method for Genetic Algorithms. In: Proc. of the IEEE Int. Conf. on Evol. Comp., New York, USA, pp. 798–803 (1996)Google Scholar
  7. 7.
    Goldberg, D.E., et al.: Genetic Algorithms with Sharing for Multimodal Function Optimization. In: Proc. of the Second Int. Conf. on Genetic Algorithms, pp. 41–49 (1987)Google Scholar
  8. 8.
    Li, J.P., et al.: A Species Conserving Genetic Algorithm for Multimodal Function Optimization. Evol. Comput. 10(3), 207–234 (2002)CrossRefGoogle Scholar
  9. 9.
    Zaharie, D.: Extensions of Differential Evolution Algorithms for Multimodal Optimization. In: Proc. of 6th Int. Symposium of Symbolic and Numeric Algorithms for Scientific Computing, pp. 523–534 (2004)Google Scholar
  10. 10.
    Cavicchio, D.J.: Adaptive Search Using Simulated Evolution. Ph.D. dissertation, Univer-sity of Michigan, Ann Arbor (1970)Google Scholar
  11. 11.
    Li, X.D.: A Multimodal Particle Swarm Optimizer Based on Fitness Euclidean-distance Ration. In: Proc. of Genetic and Evolutionary Computation Conference, pp. 78–85 (2007)Google Scholar
  12. 12.
    Qu, B.Y., Suganthan, P.N.: Novel Multimodal Problems and Differential Evolution with Ensemble of Restricted Tournament Selection. In: IEEE Congress on Evolutionary Computation, Barcelona, Spain, pp. 3480–3486 (2010)Google Scholar
  13. 13.
    Thomsen, R.: Multi-modal Optimization Using Crowding-based Differential Evolution. In: Proc. of the 2004 Cong. on Evolutionary Computation, vol. 2, pp. 1382–1389 (2004)Google Scholar
  14. 14.
    Storn, R., Price, K.V.: Differential Evolution-A simple and Efficient Heuristic for Global Optimization over Continuous spaces. J. of Global Optimization 11, 341–359 (1995)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Price, K.: An Introduction to Differential Evolution. New Ideas in Optimization, 79–108 (1999)Google Scholar
  16. 16.
    Ackley, D.: An Empirical Study of Bit Vector Function Optimization. In: Genetic Algorithms Simulated Annealing, pp. 170–204. Pitman, London (1987)Google Scholar
  17. 17.
    Deb, K.: Genetic Algorithms in Multimodal Function Optimization, the Clearinghouse for Genetic Algorithms, M.S Thsis and Rep. 89002, Univ. Alabama, Tuscaloosa (1989)Google Scholar
  18. 18.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1996)CrossRefMATHGoogle Scholar
  19. 19.
    Shir, O.M., Bäck, T.: Niche Radius Adaptation in the CMA-ES Niching Algorithm. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 142–151. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • J. J. Liang
    • 1
  • Bo Yang Qu
    • 1
    • 2
  • Song Tao Ma
    • 1
  • Ponnuthurai Nagaratnam Suganthan
    • 2
  1. 1.School of Electrical EngineeringZhengzhou UniversityZhengzhouChina
  2. 2.School of Electrical and Electronic EngineeringNanyang Technological UniversitySingaporeSingapore

Personalised recommendations