A cooperative particle swarm optimization with constriction factor based on simulated annealing
Tóm tắt
As many engineering optimization problems are rather complicated, it is usually necessary to search the optimal solution in a complex and huge search space. When faced with these large-scale problems, conventional optimization algorithms need to traverse the entire search space and it is impossible for them to finish the search within polynomial time. Moreover, it can’t meet requirements in terms of computation velocity, convergence and sensitivity to initial value. So, it is very difficult to apply them to engineering optimization problems. Swarm intelligence methods simulate the collective behaviors of social creatures in the nature and they come from the relationship between the community formed by simple individuals and the environment as well as the interactions between the individuals. A single individual can only perform simple tasks, but the population formed by single individuals can fulfill complex tasks. Such intelligence presented by such population is called swarm intelligence. Due to the limitations of existing optimization algorithms, it is usually impractical to obtain excellent computational performance with only one optimization algorithm. In consideration of the jumping property of simulated annealing, it is not easy to get trapped into local minimum and it has strong local search capability near the optimal value and fast convergence velocity. This paper combines it with particle swarm optimization, proposes a cooperative particle swarm optimization with constriction factor based on simulated annealing (SA-CPSO), offers guidelines on selection of related parameters and dynamically adjusts the particle velocity according to its movement track. In this way, it improves the convergence velocity of the algorithm by improving the spatial search ability of the particle so as to make the particle accept the solution which makes the fitness of the objective function “better” as well as the solution that makes the said fitness “worse” at a certain probability during the flight of the particle. The experiment shows that the SA-CPSO improves the diversity of the particle and enhances its ability to get rid of locally optimal solutions. So, SA-CPSO is not easy to be trapped into local optimum and it has stronger ability of global optimization, a faster convergence velocity and higher convergence accuracy.
Tài liệu tham khảo
Brusco MJ (2014) A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis. Comput Stat Data Anal 77(9):38–53
Lee KH, Kim KW (2015) Performance comparison of particle swarm optimization and genetic algorithm for inverse surface radiation problem. Int J Heat Mass Transf 88(9):330–337
Silva Filho TM, Pimentel BA, Souza RMCR, Oliveira ALI (2015) Hybrid methods for fuzzy clustering based on fuzzy C-means and improved particle swarm optimization. Expert Syst Appl 42(17–18):6315–6328
Balaji AN, Porselvi S (2014) Artificial immune system algorithm and simulated annealing algorithm for scheduling batches of parts based on job availability model in a multi-cell flexible manufacturing system. Procedia Eng 97:1524–1533
Hamzadayi A, Yildiz G (2013) A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines. Comput Ind Eng 66(11):1070–1084
Zaji AH, Bonakdari H, Shamshirband S, Qasem SN (2015) Potential of particle swarm optimization based radial basis function network to predict the discharge coefficient of a modified triangular side weir. Flow Meas Instrum 45(10):404–407
Lou I, Xie Z, Ung WK, Mok KM (2015) Integrating support vector regression with particle swarm optimization for numerical modeling for algal blooms of freshwater. Appl Math Model 39(10):5907–5916
Soares S, Antunes CH, Araújo R (2013) Comparison of a genetic algorithm and simulated annealing for automatic neural network ensemble development. Neurocomputing 121(11):498–511
Chambari A, Najafi AA, Rahmati SHA, Karimi A (2013) An efficient simulated annealing algorithm for the redundancy allocation problem with a choice of redundancy strategies. Reliab Eng Syst Saf 119(11):158–164
Jadoun VK, Gupta N, Niazi KR, Swarnkar A (2015) Multi-area economic dispatch with reserve sharing using dynamically controlled particle swarm optimization. Int J Electr Power Energy Syst 73(12):743–756
Örkcü HH, Özsoy VS, Aksoy E, Dogan MI (2015) Estimating the parameters of 3-p weibull distribution using particle swarm optimization: a comprehensive experimental comparison. Appl Math Comput 268(10):201–226
Askarzadeh A, dos Santos Coelho L (2015) Using two improved particle swarm optimization variants for optimization of daily electrical power consumption in multi-chiller systems. Appl Therm Eng 89(10):640–646
Tatsumi K, Ibuki T, Tanino T (2015) Particle swarm optimization with stochastic selection of perturbation-based chaotic updating system. Appl Math Comput 269(10):904–929
Dai M, Tang D, Giret A, Salido MA, Li WD (2013) Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robot Comput Integr Manuf 29(10):418–429
Örkcü HH (2013) Subset selection in multiple linear regression models: a hybrid of genetic and simulated annealing algorithms review article. Appl Math Comput 219(8):11018–11028
Yannibelli V, Amandi A (2013) Hybridizing a multi-objective simulated annealing algorithm with a multi-objective evolutionary algorithm to solve a multi-objective project scheduling problem. Expert Syst Appl 40(6):2421–2434