Abstract
In standard particle swarm optimization, velocity information only provides a moving direction of each particle of the swarm, though it also can be considered as one point if there is no limitation restriction. Predicted-velocity particle swarm optimization is a new modified version using velocity and position to search the domain space equality. In some cases, velocity information may be effectively, but fails in others. This paper presents a game-theoretic approach for designing particle swarm optimization with a mixed strategy. The approach is applied to design a mixed strategy using velocity and position vectors. The experimental results show the mixed strategy can obtain the better performance than the best of pure strategy.
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.
Similar content being viewed by others
References
Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, IV, pp. 1942–1948 (1995)
Zhang, C., Shao, H.: An ANN’s Evolved by A New Evolutionary System and Its Application. In: Proceedings of the 39th IEEE Conference on Decision and Control, pp. 3562–3563 (2000)
Salerno, J.: Using The Particle Swarm Optimization Technique to Train A Recurrent Neural Modal. In: Proceedings of the 9th IEEE International Conference on Tools with Artificial Intelligence, pp. 45–49 (1997)
Chen, C.Y., Ye, H.: Particle Swarm Optimization Algorithm and Its Application to Clustering Analysis. In: Proceedings of IEEE International Conference on Networking, Sencing and Control, pp. 789–794 (2004)
Sousa, T., Silua, A., Neves, A.: Particle Swarm Based Data Mining Algorithms for Classification Tasks. Parallel Computing 30(5), 767–783 (2004)
Li, X.: Better Spread and Convergence: Particle Swarm Multi-Objective Optimization Using The Maximum Fitness Function. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 117–128 (2004)
Juang, C.F.: A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design. IEEE Transactions on System, Man and Cybernetics- Part B: Cybernetic 34(2), 997–1006 (2004)
Shi, Y., Eberhart, R.C.: Empirical Study of Particle Swarm Optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, USA, pp. 1945–1949 (1999)
Cui, Z.H., Zeng, J.C.: A Modified Particle Swarm Optimization Predicted by Velocity. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 277–280 (2005)
Cui, Z.H., Zeng, J.C.: Modified Particle Swarm Optimization Based on Differential Modal. Journal of Computer Research and Development 43(4), 646–653 (2006)
Cui, Z.H., Zeng, J.C., Sun, G.J.: Predicted Particle Swarm Optimization. In: Proceedings of IEEE 2006 International Conference on Cognitive Information (accepted, 2006)
Reynolds, C.W.: Flocks,Ferds, and Schools: A Distributed Behavioral Model. Computer Graphics 21(4), 25–34 (1987)
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
Cui, Z., Cai, X., Zeng, J., Sun, G. (2006). Predicted-Velocity Particle Swarm Optimization Using Game-Theoretic Approach. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_16
Download citation
DOI: https://doi.org/10.1007/11816102_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)