Adaptive Comprehensive Learning Particle Swarm Optimizer with History Learning

  • J. J. Liang
  • P. N. Suganthan
Conference paper

DOI: 10.1007/11903697_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)
Cite this paper as:
Liang J.J., Suganthan P.N. (2006) Adaptive Comprehensive Learning Particle Swarm Optimizer with History Learning. In: Wang TD. et al. (eds) Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg

Abstract

This paper proposes an Adaptive Comprehensive Learning Particle Swarm Optimizer with History Learning (AH-CLPSO) based on the previous proposed Learning Particle Swarm Optimizer (CLPSO) [1], which is good at multimodal problems but converges slow on single modal problems. A self-adaptation technique is introduced to adjust the learning probability adaptively in the search process and the historical information is used in the velocity update equation to search more effectively. The experiment results show that the history learning strategy and the adaptation technique improves the performance of CLPSO on problems which need fast convergence and achieve comparable results on the problems requiring slow convergence.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J. J. Liang
    • 1
  • P. N. Suganthan
    • 1
  1. 1.School of Electrical and Electronic EngineeringNanyang Technological UniversitySingapore

Personalised recommendations