Improved Particle Swarm Optimization with low-discrepancy sequences

Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequences, but are more useful for computational methods which depend on the generation of random numbers. Some of these tasks involve approximation of integrals in higher dimensions, simulation and global optimization. Sobol, Faure and Halton sequences have already been used [7, 8, 9, 10] for initializing the swarm in a PSO. This paper investigates the effect of initiating the swarm with another classical low discrepancy sequence called Vander Corput sequence for solving global optimization problems in large dimension search spaces. The proposed algorithm called VC-PSO and another PSO using Sobol sequence (SO-PSO) are tested on standard benchmark problems and the results are compared with the Basic Particle Swarm Optimization (BPSO) which follows the uniform distribution for initializing the swarm. The simulation results show that a significant improvement can be made in the performance of BPSO, by simply changing the distribution of random numbers to quasi random sequence as the proposed VC-PSO and SO-PSO algorithms outperform the BPSO algorithm by noticeable percentage, particularly for problems with large search space dimensions.

[1]  Shuhei Kimura,et al.  Genetic algorithms using low-discrepancy sequences , 2005, GECCO '05.

[2]  J. Halton.  On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[3]  Ajith Abraham,et al.  A fuzzy adaptive turbulent particle swarm optimisation , 2007 .

[4]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[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]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

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

[9]  Nguyen Xuan Hoai,et al.  Initialising PSO with randomised low-discrepancy sequences: the comparative results , 2007, 2007 IEEE Congress on Evolutionary Computation.

[10]  Konstantinos E. Parsopoulos,et al.  PARTICLE SWARM OPTIMIZER IN NOISY AND CONTINUOUSLY CHANGING ENVIRONMENTS , 2001 .

[11]  David B. Fogel,et al.  Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking , 1996, Evolutionary Programming.

[12]  R. Brits,et al.  Solving systems of unconstrained equations using particle swarm optimization , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[13]  I. Sobol.  Uniformly distributed sequences with an additional uniform property , 1976 .

[14]  Hongmei Chi,et al.  On the Scrambled Sobol Sequence , 2005, International Conference on Computational Science.

[15]  Ajith Abraham,et al.  Fuzzy adaptive turbulent particle swarm optimization , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).

[16]  Ajith Abraham,et al.  SEARCH OPTIMIZATION USING HYBRID PARTICLE SUB- SWARMS AND EVOLUTIONARY ALGORITHMS , 2005 .

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

[18]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[19]  Frans van den Bergh,et al.  A NICHING PARTICLE SWARM OPTIMIZER , 2002 .