Abstract
As the multimodal complex problem has many local optima, basic PSO is difficult to effectively solve this kind of problem. To conquer this defect, firstly, we adopt Monte Carlo method to simulate the fly trajectory of particle, and conclude the reason for falling into local optima. Then, by defining distance, average distance and maximal distance between particles, an adaptive control factor (Adaptive rejection factor, ARF) for pp and pg was proposed to increase the ability for escaping from local optima. In order to test the proposed strategy, three test benchmarks were selected to conduct the analysis of convergence property and statistical property. The simulation results show that particle swarm optimizer based on adaptive rejection factor (ARFPSO) can effectively avoid premature phenomenon. Therefore, ARFPSO is available for complex multimodal problems.
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.
References
Kennedy, J., Eberhart, C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Washington, pp. 1942–1948 (1995)
Zhou, X.C., et al.: Remanufacturing closed-loop supply chain network design based on genetic particle swarm optimization algorithm. Journal of Central South University of Technology 19(2), 482–487 (2012)
Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6(2), 58–73 (2002)
Mendes, R., Kennedy, J., Neves, J.: The fully informed particle swarm: Simpler, maybe better. IEEE Transactions on Evolutionary Computation 8(3), 204–210 (2004)
Zhan, Z.H., et al.: Orthogonal Learning Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation PP(99), 1 (2010)
Liu, Y.M., Niu, B.: A Novel PSO Model Based on Simulating Human Social Communication Behavior. Discrete Dynamics in Nature and Society, 1–22 (2013)
Liu, Y., Zhao, Q., Shao, Z., Shang, Z., Sui, C.: Particle swarm optimizer based on dynamic neighborhood topology. In: Huang, D.-S., Jo, K.-H., Lee, H.-H., Kang, H.-J., Bevilacqua, V. (eds.) ICIC 2009. LNCS, vol. 5755, pp. 794–803. Springer, Heidelberg (2009)
Blackwell, T.: A Study of Collapse in Bare Bones Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation 16(3), 204–210 (2012)
Wan, Z.P., Wang, G.M.: A hybrid intelligent algorithm by combining particle swarm optimization with chaos searching technique for solving nonlinear bilevel programming problems. Swarm and Evolutionary Computation 8(1), 26–32 (2013)
Niu, B., Wang, H., Chai, Y.J.: Bacterial Colony Optimization. Discrete Dynamics in Nature and Society 2012, Article ID 698057, 28 pages (2012)
Niu, B., Fan, Y., Xiao, H., Xue, B.: Bacterial Foraging-Based Approaches to Portfolio Optimization with Liquidity Risk. Neurocomputing 98(3), 90–100 (2012)
Niu, B., Wang, H., Wang, J.W., Tan, L.J.: Multi-objective Bacterial Foraging Optimization. Neurocomputing 116, 336–345 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, Y., Zhang, Z., Luo, Y., Wu, X. (2014). An Improved PSO for Multimodal Complex Problem. In: Huang, DS., Han, K., Gromiha, M. (eds) Intelligent Computing in Bioinformatics. ICIC 2014. Lecture Notes in Computer Science(), vol 8590. Springer, Cham. https://doi.org/10.1007/978-3-319-09330-7_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-09330-7_44
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09329-1
Online ISBN: 978-3-319-09330-7
eBook Packages: Computer ScienceComputer Science (R0)