An algorithmic framework of discrete particle swarm optimization

Particle swarm optimization (PSO) was originally developed for continuous problem. To apply PSO to a discrete problem, the standard arithmetic operators of PSO are required to be redefined over discrete space. In this paper, a concept of distance over discrete solution space is introduced. Under this notion of distance, the PSO operators are redefined. After reinterpreting the composition of velocity of a particle, a general framework of discrete PSO algorithm is proposed. As a case study, we illustrate the application of the proposed discrete PSO algorithm to number partitioning problem (NPP) step by step. Preliminary computational experience is also presented. The successful application shows that the proposed algorithmic framework is feasible.

[1]  Tao Gong,et al.  Forma analysis of particle swarm optimisation for permutation problems , 2008 .

[2]  Thomas A. Feo,et al.  Randomized methods for the number partitioning problem , 1996, Comput. Oper. Res..

[3]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[4]  João Pedro Pedroso,et al.  Heuristics and exact methods for number partitioning , 2010, Eur. J. Oper. Res..

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

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[8]  Stephan Mertens.  The Easiest Hard Problem: Number Partitioning , 2006, Computational Complexity and Statistical Physics.

[9]  Yixin Yin,et al.  Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem , 2011, J. Comput..

[10]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[11]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[12]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[13]  Riccardo Poli,et al.  Analysis of the publications on the applications of particle swarm optimisation , 2008 .

[14]  Riccardo Poli,et al.  Geometric Particle Swarm Optimisation , 2007, EuroGP.

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

[16]  Julian Togelius,et al.  Geometric particle swarm optimization , 2008 .

[17]  Richard E. Korf,et al.  A Complete Anytime Algorithm for Number Partitioning , 1998, Artif. Intell..