Angle Modulated Particle Swarm Variants

This paper proposes variants of the angle modulated particle swarm optimization (AMPSO) algorithm. A number of limitations of the original AMPSO algorithm are identified and the proposed variants aim to remove these limitations. The new variants are then compared to AMPSO on a number of binary problems in various dimensions. It is shown that the performance of the variants is superior to AMPSO in many problem cases. This indicates that the identified limitations may have a significant effect on performance, but that the effects can be overcome by removing those limitations. It is also observed that the ability of the variants to initialize a wider range of potential solutions can be helpful during the search process.

[1]  Yasuhiko Minamide,et al.  Depth First Search , 2004, Arch. Formal Proofs.

[2]  Il-Yop Chung,et al.  Slow coherency and Angle Modulated Particle Swarm Optimization based islanding of large-scale power systems , 2009, Adv. Eng. Informatics.

[3]  Yoothana Suansook,et al.  Simulated Annealing with Iterative Improvement , 2009, 2009 International Conference on Signal Processing Systems.

[4]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

[5]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[6]  Tetsuo Tomiyama,et al.  Advanced Engineering Informatics , 2007, Adv. Eng. Informatics.

[7]  M. Golub,et al.  Comparison of Heuristic Algorithms for the N-Queen Problem , 2007, 2007 29th International Conference on Information Technology Interfaces.

[8]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization: Velocity initialization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[10]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[11]  N. Franken,et al.  Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[12]  G. Pamparà,et al.  Angle modulated population based algorithms to solve binary problems , 2012 .

[13]  Witold Pedrycz,et al.  Value-at-Risk-Based Two-Stage Fuzzy Facility Location Problems , 2009, IEEE Transactions on Industrial Informatics.

[14]  Thomas Stützle,et al.  A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.

[15]  Mohd Sharifuddin Ahmad,et al.  Using genetic algorithm for solving N-Queens problem , 2010, 2010 International Symposium on Information Technology.

[16]  Thomas Stützle,et al.  Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement , 2007, Hybrid Metaheuristics.

[17]  David C. Fisher.  On the n x n Knight Cover Problem , 2003, Ars Comb..

[18]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[19]  V. Scott Gordon,et al.  The knight's tour - evolutionary vs. depth-first search , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).