Abstract
While solving the optimization problems of complex functions, particle swarm optimization (PSO) would be easy to fall into trap in the local optimum. Besides that, it has slow convergence speed and poor accuracy during the late evolutionary period. So a SA-PSO algorithm would be proposed in this paper. Classically, the probability to accept bad solutions is high at the beginning. It allows the SA algorithm to escape from local minimum. As the result of that, the improved algorithm, combined SA with PSO, would be given in this paper. The given algorithm owned the abilities of both increasing the diversity of particle swarm and jumping out of the local optimum. In this paper, several classic unimodal/multimodal functions were used to simulate the SA-PSO algorithm. The results illustrated that SA-PSO had a stronger ability to avoid prematurity and get rid of local optimum. Compared with traditional PSO, the SA-PSO has improvement over effectiveness and accuracy to some extent. And it has competitive potential for solving other complicated optimization problems.








Similar content being viewed by others
References
Aarts E, Korst J (1990) Simulated annealing and Boltzman machine [J]
Aragon CR, Johnson DS, Mcgeoch LA et al. (1991) Optimization by simulated annealing: an experimental evaluation[C]// At&t Bell Labs :215–226
Bank M, Fatemi Ghomi SMT, Jolai F et al (2012) Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration[J]. Adv Eng Softw 47(1):1–6
Ben-Ameur W (2004) Computing the initial temperature of simulated annealing[J]. Comput Optim Appl 29(3):369–385
Bergh F, Engelbrecht AP (2001) Effects of swarm size on cooperative particle swarm Optimisers[C]. Genet Evol Comput Conf
Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques [J]. Expert Syst Appl 38(12):14439–14450
Clerc M, Kennedy J (2002) The particle swarm - explosion, stability, and convergence in a multidimensional complex space [M]. IEEE Press
Clerc M, Shi Y (2012) Beyond standard particle swarm optimisation. Int J Swarm Intell Res 1(4):46–61
Dong H, Li D, Zhang X (2018) Particle swarm optimization algorithm for dynamically adjusting inertia weight [J]. Comput Sci 45(2)
Eberhart SY (2002) Particle swarm optimization: developments, applications and resources. Paper presented at the Evol Comput, 2001. Proceedings of the 2001 Congress on
Gao Y, XIE S (2004) Particle swarm optimization algorithm based on simulated annealing [J]. Comput Eng Appl 40(1):47–50
Gao S, Yang J, Wu X et al (2005) Particle swarm optimization based on simulated annealing algorithm [J]. Comput Appl Softw 22(1):103–104
Han XL (2008) Particle swarm-simulated annealing fusion algorithm and its application in function optimization [D]. Wuhan Univ Technol
Higashi N, Iba H (2013) Particle swarm optimization with Gaussian mutation[C]. Swarm Intell Symp 2003. Sis '03. Proc IEEE: 72–79
Huang S (2009) A review of particle swarm optimization algorithm [J]. Comput Eng Des 30(8):1977–1980
Jamili A, Shafia MA, Tavakkoli-Moghaddam R (2011) A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem[J]. Int J Adv Manuf Technol 54(1–4):309–322
Kennedy J, Eberhart R. Particle swarm optimization [J]. Proc 1995 IEEE Int Conf Neural Netw (Perth, Australia), Nov. 27-Dec. 1995, 4(8):1942–1948 vol.4
Laarhoven PJM, Aarts EHL (1988) Simulated annealing: theory and applications [J]. Acta Applicandae Mathematica 12(1):108–111
Lei X, Shi Z (2008) Application and parameter analysis of particle swarm optimization algorithm in function optimization [J]. Comput Eng Appl 44(28):53–54
Li C, Yang S (2009) An adaptive learning particle swarm optimizer for function optimization[C]//. Evol Comput 2009 CEC '09 IEEE Cong IEEE : 381–388
Pan Q, Wang W, Zhu J (2006) Hybrid scheduling algorithm based on particle swarm optimization and simulated annealing [J]. Chin Mech Eng 17(10):1044–1046
Sadati N, Amraee T, Ranjbar AM (2009) A global particle swarm-based-simulated annealing optimization technique for under-voltage load shedding problem [J]. Appl Soft Comput 9(2):652–657
Wang H, Cao C (2005) Parallel particle swarm optimization based on simulated annealing [J]. Control Decision 20(5):500–504
Yang H, Yang Y, Yang Z et al (2014) A particle swarm optimization algorithm based on simulated annealing[J]. Adv Mater Res 989-994:2301–2305
Yu H, Liu H (2012) Z. Wu. Improved strategy of adaptive particle swarm optimization based on simulated annealing [J]. J Comput Appl 29(12):4448–4450
Zhang Y C, Xiong X, Zhang Q D. An improved self-adaptive PSO algorithm with detection function for multimodal function optimization problems [J]. Math Probl Eng, 2013, (2013-12-24), 2013, 2013(12):657–675
Zhang C, Li Q, Wang W et al (2017) Immune particle swarm optimization algorithm based on adaptive search[J]. J Univ Sci Technol Beijing 39(1):125–132
Zhu Y, Zhong Y (2009) An improved simulated annealing algorithm [J]. Comput Technol Dev 19(6):32–35
Acknowledgements
This work is supported by the project of the First-Class University and the First-Class Discipline (No.10301-017004011501).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
We declare that there are no commercial or associative interest that represents a conflict of interest in connection with the work submitted.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pan, X., Xue, L., Lu, Y. et al. Hybrid particle swarm optimization with simulated annealing. Multimed Tools Appl 78, 29921–29936 (2019). https://doi.org/10.1007/s11042-018-6602-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-018-6602-4