A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM

Particle Swarm Optimization (PSO) is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. PSO is similar to the Genetic Algorithm (GA) in the sense that these two evolutionary heuristics are population-based search methods. In other words, PSO and the GA move from a set of points (population) to another set of points in a single iteration with likely improvement using a combination of deterministic and probabilistic rules. The GA and its many versions have been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, and the ability to effectively solve highly nonlinear, mixed integer optimization problems that are typical of complex engineering systems. The drawback of the GA is its expensive computational cost. This paper attempts to examine the claim that PSO has the same effectiveness (finding the true global optimal solution) as the GA but with significantly better computational efficiency (less function evaluations) by implementing statistical analysis and formal hypothesis testing. The performance comparison of the GA and PSO is implemented using a set of benchmark test problems as well as two space systems design optimization problems, namely, telescope array configuration and spacecraft reliability-based design.

[1]  William Volk,et al.  Applied statistics for engineers , 1971 .

[2]  W. Volk,et al.  Applied Statistics for Engineers (2nd ed.). , 1982 .

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Timothy J. Cornwell,et al.  A novel principle for optimization of the instantaneous Fourier plane coverage of correction arrays , 1988 .

[5]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

[7]  Eric Keto,et al.  The Shapes of Cross-Correlation Interferometers , 1997 .

[8]  William A. Crossley,et al.  Empirically-Derived Population Size and Mutation Rate Guidelines for a Genetic Algorithm with Uniform Crossover , 1998 .

[9]  Jaroslaw Sobieszczanski-Sobieski,et al.  Particle swarm optimization , 2002 .

[10]  Tapabrata Ray,et al.  Golinski's speed reducer problem revisited , 2003 .

[11]  Rania Hassan,et al.  Multi-Objective Optimization of Communication Satellites with Two-Branch Tournament Genetic Algorithm , 2003 .

[12]  Babak E. Cohanim,et al.  The Design of Radio Telescope Array Configurations using Multiobjective Optimization: Imaging Performance versus Cable Length , 2004, astro-ph/0405183.

[13]  Rania Hassan,et al.  Genetic algorithm approaches for conceptual design of spacecraft systems including multi-objective optimization and design under uncertainty , 2004 .

[14]  Rania Hassan,et al.  VARIABLE POPULATION-BASED SAMPLING FOR PROBABILISTIC DESIGN OPTIMIZATION WITH A GENETIC ALGORITHM , 2004 .