Abstract
The parallelization of particle swarm optimization (PSO) is an efficient way to improve the performance of PSO. The multiple population parallelization is one way to parallelize PSO, in which three parameters need to be manually set in advance. They are migration interval, migration rate, and migration direction, which decide when, how many and from which subpopulation to which subpopulation particles will be migrated, respectively. However, there are two shortcomings concerning manually setting these three parameters in advance. One is that good particles cannot be migrated in time since particles can only be migrated every a given interval and in a given direction in parallel PSO. The other is that a large number of unnecessary migrations will take place since a given rate of particles in each subpopulation will be migrated every a given interval in a given direction. Both may be bad for parallel PSO to find high-quality solutions as quickly as possible, and this will result in a huge communication cost. Inspired by the phenomenon of osmosis, this paper presents a multiple population parallel version of PSO based on osmosis. It can adaptively decide when, how many, and from which subpopulation to which subpopulation particles will be migrated. Its usefulness, especially for high-dimensional functions, is demonstrated by numerical experiments.
Similar content being viewed by others
References
Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948
Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin
McMullen PR, Tarasewich P (2003) Using ant techniques to solve the assembly line balancing problem. IIE Trans 35(7):605–617
Xiang Y, Zhou Y, Liu H (2015) An elitism based multi-objective artificial bee colony algorithm. Eur J Oper Res 245(1):168–193
Ali ES, Abd Elazim SM, Abdelaziz AY (2016) Ant lion optimization algorithm for renewable distributed generations. Energy 116:445–458
Ali ES, Abd Elazim SM, Abdelaziz AY (2016) Improved harmony algorithm and power loss index for optimal locations and sizing of capacitors in radial distribution systems. Int J Electr Power Energy Syst 80:252–263
Li H (2014) A teaching quality evaluation model based on a wavelet neural network improved by particle swarm optimization. Cybern Inf Technol 14(3):110–120
Jordehi AR (2014) Particle swarm optimisation for dynamic optimisation problems: a review. Neural Comput Appl 25(7–8):1507–1516
Karahan H (2012) Determining rainfall-intensity-duration-frequency relationship using particle swarm optimization. KSCE J Civil Eng 16(4):667–675
Ouyang A, Li K, Truong TK, Sallam A, Sha HM (2014) Hybrid particle swarm optimization for parameter estimation of Muskingum model. Neural Comput Appl 25(7–8):1785–1799
Pant M, Thangaraj R, Abraham A (2009) Particle swarm optimization: performance tuning and empirical analysis. In: Abraham A, Hassanien A-E, Siarry P, Engelbrecht A (eds) Foundations of computational intelligence, vol 3. Springer, Berlin Heidelberg, pp 101–128
Niu B, Zhu Y, He X, Wu H (2007) MCPSO: a multi-swarm cooperative particle swarm optimizer. Appl Math Comput 185(2):1050–1062
Deep K, Arya M, Barak S (2010) A new multi-swarm particle swarm optimization and its application to Lennard-Jones problem. INFOCOMP 9(3):52–60
Schutte JF, Reinbolt JA, Fregly BJ, Haftka RT, George AD (2004) Parallel global optimization with the particle swarm algorithm. J Numer Methods Eng 61(13):2296–2315
Koh BI, George AD, Haftka RT, Fregly BJ (2006) Parallel asynchronous particle swarm optimization. Int J Numer Methods Eng 67(4):578–595
Fan S, Chang J (2009) A parallel particle swarm optimization algorithm for multi-objective optimization problems. Eng Optim 41(7):673–697
Shao B, Liu J, Huang Z, Li R (2011) A parallel particle swarm optimization algorithm for reference stations distribution. J Softw 6(7):1281–1288
Kamal A, Mahroos M, Sayed A, Nassar A (2012) Parallel particle swarm optimization for global multiple sequence alignment. Inf Technol J 11(8):998–1006
Moraes AOS, Mitre JF, Lage PLC, Secchi AR (2015) A robust parallel algorithm of the particle swarm optimization method for large dimensional engineering problems. Appl Math Model 39(14):4223–4241
Gülcü S, Kodaz H (2015) A novel parallel multi-swarm algorithm based on comprehensive learning particle swarm optimization. Eng Appl Artif Intell 45:33–45
Suzuki M (2016) Adaptive parallel particle swarm optimization algorithm based on dynamic exchange of control parameters. Am J Oper Res 6(5):401–413
Wu Q, Xiong F, Wang F, Xiong Y (2016) Parallel particle swarm optimization on a graphics processing unit with application to trajectory optimization. Eng Optim 48(10):1679–1692
Cao J, Cui H, Shi H, Jiao L (2016) Big data: a parallel particle swarm optimization-back-propagation neural network algorithm based on mapreduce. Plos One 11(6):e0157551
Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6(5):443–462
Waintraub M, Schirru R, Pereira CMNA (2009) Multiprocessor modeling of parallel particle swarm optimization applied to nuclear engineering problems. Prog Nuclear Energy 51(6–7):680–688
Chang JF, Chu SC, Roddick JF, Pan JS (2005) A parallel particle swarm optimization algorithm with communication strategies. J Inf Sci Eng 21(4):809–818
Yao X, Liu Y (1996) Fast evolutionary programming. In: Proceedings of the fifth annual congress on evolutionary computation, pp 451–460
Zhao X, Gao X-S (2007) Binary affinity genetic algorithm. J Heuristics 13(2):133–150
Vesterstrom J, Thomsen R (2004) A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Proceedings of congress on evolutionary programming, pp 1980–1987
Shi Y, Eberhart R (1998) A modified particle swarm optimization. In: Proceedings of IEEE international conference on evolutionary computation, pp 69–73
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82
Bratton D, Kennedy J (2007) Defining a standard for particle swarm optimization. In: Proceedings of the 2007 IEEE swarm intelligence symposium, pp 120–127
Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132
Acknowledgements
This paper is supported by the National Natural Science Foundation of China (Grant numbers 61562071, 61773410, 61165003, 61472143), the Scientific Research Special Plan of Guangzhou Science and Technology Programme (Grant no. 201607010045), and the Natural Science Foundation of Jiangxi Province (Grant no. 20151BAB207020).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
Rights and permissions
About this article
Cite this article
Lai, X., Zhou, Y. An adaptive parallel particle swarm optimization for numerical optimization problems. Neural Comput & Applic 31, 6449–6467 (2019). https://doi.org/10.1007/s00521-018-3454-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-018-3454-9