Parallel Multi-Swarm PSO Based on K-Medoids and Uniform Design

PAM (Partitioning around Medoid) is introduced to divide the swarm into several different sub- populations. PAM is one of k-medoids clustering algorithms based on partitioning methods. It attempts to divide n objects into k partitions. This algorithm overcomes the drawbacks of being sensitive to the initial partitions in k- means algorithm. In the parallel PSO algorithms, the swarm needs to be divided into several different smaller swarms. This study can be excellently completed by PAM. The aim of clustering is that particles within the same sub-population are relative concentrative, so that they can be relatively easy to learn. The purposes of this strategy are that the limited time will be spent on the most effective search; therefore, the search efficiency can also be significantly improved. In order to explore the whole solution space evenly, uniform design is introduced to generate an initial population, in which the population members are scattered uniformly over the feasible solution space. In evolution, uniform design is also introduced to replace some worse individuals. Based on abovementioned these technologies, a novel algorithm, parallel multi-swarm PSO based on k-medoids and uniform design, is proposed. A difference between the proposed algorithm and the others is that PAM and uniform design are both firstly introduced to parallel PSO algorithms.

[1]  Bu-Sung Lee,et al.  Efficient Hierarchical Parallel Genetic Algorithms using Grid computing , 2007, Future Gener. Comput. Syst..

[2]  Junyan Wang,et al.  Nonlinear Inertia Weight Variation for Dynamic Adaptation in Particle Swarm Optimization , 2011, ICSI.

[3]  Hugo de Garis,et al.  A novel evolutionary algorithm based on an orthogonal design for dynamic optimization problems (ODEA) , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  Junjie Yang,et al.  A Precise Chaotic Particle Swarm Optimization Algorithm based on Improved Tent Map , 2008, 2008 Fourth International Conference on Natural Computation.

[5]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[6]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Yuping Wang,et al.  Multiobjective programming using uniform design and genetic algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[8]  Ettore Francesco Bompard,et al.  A self-adaptive chaotic particle swarm algorithm for short term hydroelectric system scheduling in deregulated environment , 2005 .

[9]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[12]  Carlos A. Coello Coello,et al.  MRMOGA: a new parallel multi‐objective evolutionary algorithm based on the use of multiple resolutions , 2007, Concurr. Comput. Pract. Exp..

[13]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[14]  Li Liao,et al.  Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem , 2007, 2007 IEEE International Conference on Automation and Logistics.

[15]  Jie Zhang,et al.  The Particle Swarm Optimization Algorithm Based on Dynamic Chaotic Perturbations and its Application to K-Means , 2009, 2009 International Conference on Computational Intelligence and Security.

[16]  Mohammad Mehdi Ebadzadeh,et al.  A novel particle swarm optimization algorithm with adaptive inertia weight , 2011, Appl. Soft Comput..

[17]  Yong Feng,et al.  Comparing with Chaotic Inertia Weights in Particle Swarm Optimization , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[18]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[19]  Xinbo Huang,et al.  Natural Exponential Inertia Weight Strategy in Particle Swarm Optimization , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[20]  Xiaodong Li,et al.  A particle swarm model for tracking multiple peaks in a dynamic environment using speciation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[21]  Xue-yao Gao,et al.  A Modified Particle Swarm Optimization Algorithm Based on Improved Chaos Search Strategy , 2008, 2008 International Symposium on Computational Intelligence and Design.