Estimation of particle swarm distribution algorithms: bringing together the strengths of PSO and EDAs

ABSTRACT

This paper presents a framework of estimation of particle swarm distribution algorithms (EPSDAs). The aim lies in effectively combining particle swarm optimization (PSO) with estimation of distribution algorithms (EDAs) without losing on their unique features. To exhibit its practicability, an extended compact particle swarm optimization (EcPSO) is developed along the lines of the suggested framework. Empirical results have adduced grounds for its effectiveness.

REFERENCES

• 1: Chang Wook Ahn, Advances in Evolutionary Algorithms: Theory, Design and Practice (Studies in Computational Intelligence), Springer-Verlag New York, Inc., Secaucus, NJ, 2006
• 2: Harik, G., Lobo, F., and Sastry, K. (2006). Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA). Studies in Comput. Intel., 33: 39--61.
• 3: Iqbal, M. and Montes, M. (2006). An Estimation of Distribution Particle Swarm Optimization Algorithm. LNCS 4150:72--83.
• 4: Kennedy, J. and Eberhart, R. (1995). Particle Swarm Optimization. In Proc. of IEEE ICNN'95, pages 1942--1948.
• 5: Wang J. (2007). A Novel Discrete Particle Swarm Optimization Based on Estimation of Distribution. LNAI 4682:791--802.
• 6: Yalan Zhou , Jiahai Wang , Jian Yin, A Discrete Estimation of Distribution Particle Swarm Optimization for Combinatorial Optimization Problems, Proceedings of the Third International Conference on Natural Computation, p.80-84, August 24-27, 2007 [doi>10.1109/ICNC.2007.18]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods

General Terms:
Algorithms, Design, Experimentation

Keywords:
estimation of distribution algorithms, local/global search, particle swarm optimization