Probabilistically Driven Particle Swarms for Optimization of Multi Valued Discrete Problems : Design and Analysis

A new particle swarm optimization (PSO) algorithm that is more effective for discrete, multi-valued optimization problems is presented. The new algorithm is probabilistically driven since it uses probabilistic transition rules to move from one discrete value to another in the search for an optimum solution. Properties of the binary discrete particle swarms are discussed. The new algorithm for discrete multi-values is designed with the similar properties. The algorithm is tested on a suite of benchmarks and comparisons are made between the binary PSO and the new discrete PSO implemented for ternary, quaternary systems. The results show that the new algorithm's performance is close and even slightly better than the original discrete, binary PSO designed by Kennedy and Eberhart. The algorithm can be used in any real world optimization problems, which have a discrete, bounded field

[1]  Jigui Sun,et al.  An Improved Discrete Particle Swarm Optimization Algorithm for TSP , 2007, 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops.

[2]  Junjun Li,et al.  A Modified Particle Swarm Optimization Algorithm , 2004, 2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing.

[3]  E. Ozcan,et al.  Particle swarm optimization: surfing the waves , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  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).

[5]  David B. Fogel,et al.  Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .

[6]  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.

[7]  Jing J. Liang,et al.  Novel composition test functions for numerical global optimization , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

[8]  Chilukuri K. Mohan,et al.  Multi-phase Discrete Particle Swarm Optimization , 2002, JCIS.

[9]  Alex Alves Freitas,et al.  A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set , 2006, GECCO.

[10]  Kalyan Veeramachaneni,et al.  Optimization Using Particle Swarms with Near Neighbor Interactions , 2003, GECCO.

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

[12]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[13]  Alcherio Martinoli,et al.  Discrete Multi-Valued Particle Swarm Optimization , 2006 .

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