Summary
The purpose of this chapter is to draw attention to two points that are not always well understood, namely, a) the “balance” between exploitation and exploration may be not what we intuitively think, and b) a mean best result may be meaningless. The second point is obviously quite important when two algorithms are compared. These are discussed in the appendix. We believe that these points would be useful to researchers in the field for analysis and comparison of algorithms in a better and rigorous way, and help them design new powerful tools.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben Ghalia, M.: Particle swarm optimization with an improved exploration-exploitation balance. In: Circuits and Systems, MWSCAS, pp. 759–762. Circuits and Systems, MWSCAS (2008)
CEC. Congress on Evolutionary Computation Benchmarks (2005), http://www3.ntu.edu.sg/home/epnsugan/
Clerc, M.: Math Stuff about PSO, http://clerc.maurice.free.fr/pso/
Clerc, M.: Particle Swarm Optimization. ISTE (International Scientific and Technical Encyclopedia) (2006)
Clerc, M.: Stagnation analysis in particle swarm optimization or what happens when nothing happens, Technical report (2006), http://hal.archives-ouvertes.fr/hal-00122031
Clerc, M.: Why does it work? International Journal of Computational Intelligence Research 4(2), 79–91 (2008)
Clerc, M., Kennedy, J.: The Particle Swarm-Explosion, Stability, and Convergence in a Multidimensional Complex Space. IEEE Transactions on Evolutionary Computation 6(1), 58–73 (2002)
Fernandez-Martinez, J.L., Garcia-Gonzalo, E., Fernandez-Alvarez, J.P.: Theoretical analysis of particle swarm trajectories through a mechanical analogy. International Journal of Computational Intelligent Research (this issue, 2007)
Gacôgne, L.: Steady state evolutionary algorithm with an operator family. In: EISCI, Kosice, Slovaquie, pp. 373–379 (2002)
Helwig, S., Wanka, R.: Particle swarm optimization in high-dimensional bounded search spaces. In: IEEE Swarm Intelligence Symposium (SIS 2007) (2007)
Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 889–898. Springer, Heidelberg (2008)
Kennedy, J.: Bare Bones Particle Swarms. In: IEEE Swarm Intelligence Symposium, pp. 80–87 (2003) (Fully informed PSO)
Kennedy, J.: How it works: Collaborative Trial and Error. International Journal of Computational Intelligence Research 4(2), 71–78 (2008)
Koduru, P., et al.: A particle swarm optimization-nelder mead hybrid algorithm for balanced exploration and exploitation in multidimensional search space (2006)
Langdon, W., Poli, R.: Evolving problems to learn about particle swarm and other optimisers. In: Congress on Evolutionary Computation, pp. 81–88 (2005)
Li, N., Sun, D., Zou, T., Qin, Y., Wei, Y.: Analysis for a particle’s trajectory of pso based on difference equation. Jisuanji Xuebao/Chinese Journal of Computers 29(11), 2052–2061 (2006)
Marsaglia, G., Zaman, A.: The kiss generator. Technical report, Dept. of Statistics, U. of Florida (1993)
Mendes, R.: Population Topologies and Their Influence in Particle Swarm Performance. PhD thesis, Universidade do Minho (2004)
Onwubolu, G.C., Babu, B.V.: New Optimization Techniques in Engineering. Springer, Berlin (2004)
Parsopoulos, K.E., Vrahatis, M.N.: Parameter selection and adaptation in unified particle swarm optimization. Mathematical and Computer Modelling 46, 198–213 (2007)
Poli, R.: The Sampling Distribution of Particle Swarm Optimisers and their Stability. Technical report, University of Essex (2007); Poli, R.: On the moments of the sampling distribution of particle swarm optimisers. GECCO (Companion), 2907–2914 (2007)
Poli, R.: Dynamics and stability of the sampling distribution of particle swarm optimisers via moment analysis. Journal of Artificial Evolution and Applications (2008)
Poli, R., Langdon, W.B., Clerc, M., Stephen, C.R.: Continuous Optimisation Theory Made Easy? Finite-Element Models of Evolutionary Strategies, Genetic Algorithms and Particle Swarm Optimizers. In: Stephens, C.R., et al. (eds.) Foundations of Genetic Algorithms, Mexico, vol. 9, pp. 165–193. Springer, Heidelberg (2007)
PSC. Particle Swarm Central, http://www.particleswarm.info
Richards, M., Ventura, D.: Dynamic Sociometry and Population Size in Particle Swarm Optimization. C’est juste un extrait de la thèse (2003)
Sandgren, E.: Non linear integer and discrete programming in mechanical design optimization (1990) ISSN 0305-2154
Shang, Y.-W., Qiu, Y.-H.: A note on the extended rosenbrock function. Evolutionary Computation 14(1), 119–126 (2006)
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)
Wong, T.-T., Luk, W.-S., Heng, P.-A.: Sampling with Hammersley and Halton points. Journal of Graphics Tools 2(2), 9–24 (1997)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Clerc, M. (2011). From Theory to Practice in Particle Swarm Optimization. In: Panigrahi, B.K., Shi, Y., Lim, MH. (eds) Handbook of Swarm Intelligence. Adaptation, Learning, and Optimization, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17390-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-17390-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17389-9
Online ISBN: 978-3-642-17390-5
eBook Packages: EngineeringEngineering (R0)