Abstract
A new model for evolving the structure of a Particle Swarm Optimization (PSO) algorithm is proposed in this paper. The model is a hybrid technique that combines a Genetic Algorithm (GA) and a PSO algorithm. Each GA chromosome is an array encoding a meaning for updating the particles of the PSO algorithm. The evolved PSO algorithm is compared to a human-designed PSO algorithm by using ten artificially constructed functions and one real-world problem. Numerical experiments show that the evolved PSO algorithm performs similarly and sometimes even better than standard approaches for the considered problems.
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
Carlisle, A., Dozier, G.: An Off-the-shelf PSO. In: Proceedings of the Particle Swarm Optimization Workshop, pp. 1–6 (2001)
Chang, T.-J., et al.: Heuristics for cardinality constrained portfolio optimisation. Comp. & Opns. Res. 27, 1271–1302 (2000)
Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1999), pp. 1951–1957 (1999)
Eberhart, R.C., Shi, Y.: Comparison Between Genetic Algorithms and Particle Swarm Optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 611–616. Springer, Heidelberg (1998)
Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proceedings of the CEC (2001)
Goldberg, D.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Boston, USA (1989)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Koza, J.R.: Genetic programming, On the programming of computers by means of natural selection. MIT Press, Cambridge (1992)
Markowitz, H.: Portfolio Selection. Journal of Finance 7, 77–91 (1952)
Oltean, M., Groşan, C.: Evolving evolutionary algorithms using multi expression programming. In: Banzhaf, W., Ziegler, J., Christaller, T., Dittrich, P., Kim, J.T. (eds.) ECAL 2003. LNCS, vol. 2801, pp. 651–658. Springer, Heidelberg (2003)
Oltean, M.: Evolving evolutionary algorithms using Linear Genetic Programming. Evolutionary Computation 13(3) (2005)
Parsopoulos, K.E., Vrahatis, M.N.: Recent approaches to global optimization problems through Particle Swarm Optimization. Natural Computing 1, 235–306 (2002)
Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. Global Optimization 11, 341–359 (1997)
Tavares, J., Machado, P., Cardoso, A., Pereira, F.B., Costa, E.: On the evolution of evolutionary algorithms. In: Keijzer, M., O’Reilly, U.-M., Lucas, S., Costa, E., Soule, T., et al. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 389–398. Springer, Heidelberg (2004)
Xiaohui, H., Yuhui, S., Eberhart, R.: Recent Advances in Particle Swarm. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 90–97 (2004)
Yao, X., Liu, Y., Lin, G.: Evolutionary Programming Made Faster. In: IEEE Transaction on Evolutionary Computation, pp. 82–102 (1999)
Wolpert, D.H., McReady, W.G.: No Free Lunch Theorems for Optimization. In: IEEE Transaction on Evolutionary Computation, vol. 1, pp. 67–82. IEEE Press, NY, USA (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dioşan, L., Oltean, M. (2006). Evolving the Structure of the Particle Swarm Optimization Algorithms. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2006. Lecture Notes in Computer Science, vol 3906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11730095_3
Download citation
DOI: https://doi.org/10.1007/11730095_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33178-0
Online ISBN: 978-3-540-33179-7
eBook Packages: Computer ScienceComputer Science (R0)