Abstract
Particle swarm optimization (PSO) and fast evolutionary programming (FEP) are two widely used population-based optimisation algorithms. The ideas behind these two algorithms are quite different. While PSO is very efficient in local converging to an optimum due to its use of directional information, FEP is better at global exploration and finding a near optimum globally. This paper proposes a novel hybridisation of PSO and FEP, i.e., fast PSO (FPSO), where the strength of PSO and FEP is combined. In particular, the ideas behind Gaussian and Cauchy mutations are incorporated into PSO. The new FPSO has been tested on a number of benchmark functions. The preliminary results have shown that FPSO outperformed both PSO and FEP significantly.
This work is partially supported by the National Natural Science Foundation of China through Grant No. 60573170 and Grant No. 60428202.
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
Yao, X., Liu, Y., Lin, G.: Evolutionary Programming Made Faster. IEEE Trans. on Evolutionary Computation 2(2), 82–102 (1999)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE Press, Los Alamitos (1995)
Lee, C.Y., Yao, X.: Evolutionary programming using the mutations based on Lévy probability distribution. IEEE Transactions on Evolutionary Computation 8(5), 456–470 (2004)
Schnier, T., Yao, X.: Using Multiple Representations in Evolutionary Algorithms. In: Proceedings of the 2000 Congress on Evolutionary Computation, Piscataway, NJ, USA, July 2000, pp. 479–486. IEEE Press, Los Alamitos (2000)
Bäck, T., Schwefel, H.-P.: An overview of evolutionary algorithms for parameter optimization. Evol. Comput. 1(1), 1–23 (1993)
Gehlharr, D.K., Fogel, D.B.: Tuning evolutionary programming for conformationally flexible molecular docking. In: Fogel, L.J., Angeline, P.J., Bäck, T. (eds.) Evolutionary Programming V: Proc. of the Fifth Annual Conference on Evolutionary Programming, pp. 419–429. MIT Press, Cambridge, MA (1996)
Tu, Z., Lu, Y.: A Robust Stochastic Genetic Algorithm (StGA) for Global Numerical Optimization. IEEE Trans. on Evolutionary Computation 8(5), 456–470 (2004)
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
He, J., Yang, Z., Yao, X. (2006). Hybridisation of Particle Swarm Optimization and Fast Evolutionary Programming. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_50
Download citation
DOI: https://doi.org/10.1007/11903697_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47331-2
Online ISBN: 978-3-540-47332-9
eBook Packages: Computer ScienceComputer Science (R0)