Adaptive Parallel Particle Swarm Optimization Algorithm Based on Dynamic Exchange of Control Parameters
- 1 Department of Industrial Administration, Tokyo University of Science, Chiba, Japan
Abstract
Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.
- Kennedy, J. and Eberhart, R.C. (1995) Particle Swarm Optimization. Proceeding of IEEE International Conference on Neural Networks, 4, 1942-1948. http://dx.doi.org/10.1109/ICNN.1995.488968
- Janson, S. and Middendorf, M. (2005) A Hierarchical Particle Swarm Optimizer and Its Adaptive Variant. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 35, 1272- 1282. http://dx.doi.org/10.1109/TSMCB.2005.850530
- Yen, G.G. and Daneshyari, M. (2006) Diversity-Based Information Exchange among Multiple Swarms in Particle Swarm Optimization. Proceeding of IEEE Congress on Evolutionary Computation (CEC 2006), Vancouver, 16-21 July 2006, 6150-6157. http://dx.doi.org/10.1109/cec.2006.1688511
- Eberhart, R.C. and Shi, Y. (2000) Comparing Inertia Weights and Constrictions Factors in Particle Swarm Optimization. Proceeding of the Congress on Evolutionary Computation (CEC 2000), San Diego, 16-19 July 2000, 84-88. http://dx.doi.org/10.1109/cec.2000.870279
- Clerc, M. and Kennedy, J. (2002) The Particle Swarm: Explosion, Stability, and Convergence in a Multi-Dimensional Complex Space. IEEE Transactions on Evolutionary Computation, 6, 58-73. http://dx.doi.org/10.1109/4235.985692
- Parsopoulos, K.E. and Vrahatis, M.N. (2002) Recent Approaches to Global Optimization Problems through Particle Swarm Optimization. Natural Computing, 1, 235-306. http://dx.doi.org/10.1023/A:1016568309421
- Cooren, Y., Clerc, M. and Siarry, P. (2009) Performance Evaluation of TRIBES, an Adaptive Particle Swarm Optimization Algorithm. Swarm Intelligence, 3, 149-178. http://dx.doi.org/10.1007/s11721-009-0026-8
- Jana, N.D. and Sil, J. (2014) Particle Swarm Optimization with Lévy Flight and Adaptive Polynomial Mutation in Gbest Particle. Recent Advances in Intelligent Informatics, 235, 275-282. http://dx.doi.org/10.1007/978-3-319-01778-5_28
- Mikki, S.M. and Kishk, A.A. (2006) Quantum Particle Swarm Optimization for Electromagnetics. IEEE Transactions on Antennas and Propagation, 54, 2764-2775. http://dx.doi.org/10.1109/TAP.2006.882165
- Hukushima, K. and Nemoto, K. (1996) Exchange Monte Carlo Method and Application to Spin Glass Simulations. Journal of the Physical Society of Japan, 65, 1604-1608. http://dx.doi.org/10.1143/JPSJ.65.1604
- Shi, Y. and Eberhart, R.C. (1998) Parameter Selection in Particle Swarm Optimization, Evolutionary Programming VII. Lecture Notes in Computer Science, 1447, 591-600. http://dx.doi.org/10.1007/BFb0040810