Abstract
This article proposes a hybrid Particle Swarm Optimization (PSO) based on the Nonlinear Simplex Method (NSM). At late stage of PSO running, when the promising regions of solutions have been located, the algorithm isolates particles which are very close to the extrema and applies the NSM to them to enhance the local exploitation. Experimental results on several benchmark functions demonstrate that this approach is very effective and efficient, especially for multimodal function optimizations. It yields better solution qualities and success rates compared to other methods taken from the literature.
Key words
Download to read the full chapter text
Chapter PDF
Reference
Bonabeau E, Dorigo M, and Theraulaz G. Swarm Intelligence: From Natural to Artificial Systems. Oxford Press, 1999
Kennedy J, and Eberhart R C. Swarm Intelligence. Kaufmann Publishers, Morgan, 2001
Deneubourg J L, Goss S, Franks N, Sendova-Franks A, Detrain C, and Chrétien L. The dynamics of collective sorting: Robot-like ants and ant-like robots. Proceedings of the First International Conference on Simulation of Adaptive Behaviour: From Animals to Animats 1, 1991, MIT Press, Cambridge, MA: 356–365
Kennedy J, and Eberhart R C. Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks, 1995, Piscataway, NJ: 1942–1948
Shi Y, and Eberhart R C. Parameter selection in particle swarm optimization. Evolutionary Programming VII: Proceedings of the 7th Annual Conference on Evolutionary Programming, 1998, New York: 591–600
Shi Y, and Eberhart R C. Empirical study of particle swarm optimization. Proceedings of the IEEE Congress on Evolutionary Computation, 1999, Piscataway, NJ: 1945–1950
Parsopoulos K E, and Vrahatis M N. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing, 2002, Vol. 1: 235–306
Shu-Kai S. Fan, Yun-Chia Liang, and Erwie Zahara. Hybrid Simplex Search and Particle Swarm Optimization for the Global Optimization of Multimodal Functions. Engineering Optimization, 2004, 36(4): 401–418
Parsopoulos K E, and Vrahatis M N. Initializing the particle swarm optimizer using the nonlinear simplex Method. Advances in Intelligent Systems, Fuzzy Systems, Evolutionary Computation, 2002, WSEAS Press: 216–221
Clerc M. The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. Proceedings of the IEEE Congress on Evolutionary Computation, 1999: 1951–1957
Carlisle A, and Dozier G. An off-the-shelf PSO. Proceedings of the Workshop on Particle Swarm Optimization, 2001, Indianapolis
Clerc M, and Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 2002, 6(1): 58–73
Nelder J, and Mead R. A simplex method for function minimization. Computer Journal, 1965, Vol. 7:308–313
Levy A, Montalvo A, Gomez S, et al. Topics in Global Optimization. Springer-Verlag, New York: 1981
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Wang, F., Qiu, Y. (2005). Improving the Particle Swarm Optimization Algorithm Using the Simplex Method at Late Stage. In: Li, D., Wang, B. (eds) Artificial Intelligence Applications and Innovations. AIAI 2005. IFIP — The International Federation for Information Processing, vol 187. Springer, Boston, MA. https://doi.org/10.1007/0-387-29295-0_38
Download citation
DOI: https://doi.org/10.1007/0-387-29295-0_38
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-28318-0
Online ISBN: 978-0-387-29295-3
eBook Packages: Computer ScienceComputer Science (R0)