Breadcrumb
- Home
- Publications
- Proceedings
- 2005 Annual Meeting
- Computing and Systems Technology Division
- Advances in Optimization II
- (106a) Particle Swarm Optimization in Discontinuous Function Spaces
In this work, we try to find multiple minima in discontinuous function spaces through stochastic methods such as PSO, genetic algorithms and simulated annealing. We compare the performance of PSO in these discontinuous function spaces with the other stochastic methods. We quantify the performance of the swarm by both the number of distinct solutions it finds and the objective function values at each of these minima. We investigate the effect of swarm topology and optimization parameters on the performance of PSO and the computational effort it requires. We investigate the use of random noise in inter-particle communication in the swarm optimization to simulate uncertainty in the data and also to provide higher driving forces in excessively flat function spaces. In this work, we summarize all our results and offer some general conclusions.
References 1. Eberhart, R. C. and Kennedy, S., Proc. Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39-43 (1995). 2. Kennedy, S. and Eberhart, R.C., Swarm Intelligence, Morgan Kaufman, San Francisco (2001). 3. Bonabeau, E., Dorigo, M. and Theraulaz, G., Nature, 406, 39 (2000).