Hybridisation of Particle Swarm Optimization and Fast Evolutionary Programming
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.
KeywordsParticle Swarm Optimization Benchmark Function Multimodal Function Standard Particle Swarm Optimization Global Good Position
Unable to display preview. Download preview PDF.
- 1.Yao, X., Liu, Y., Lin, G.: Evolutionary Programming Made Faster. IEEE Trans. on Evolutionary Computation 2(2), 82–102 (1999)Google Scholar
- 4.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)Google Scholar
- 6.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)Google Scholar