Parallel recombinative simulated annealing: a genetic algorithm
Parallel Computing
Parameter Selection in Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
The particle swarm optimization algorithm: convergence analysis and parameter selection
Information Processing Letters
A fuzzy adaptive turbulent particle swarm optimisation
International Journal of Innovative Computing and Applications
Hybrid particle swarm optimization algorithm with fine tuning operators
International Journal of Bio-Inspired Computation
Predicted modified PSO with time-varying accelerator coefficients
International Journal of Bio-Inspired Computation
A study on the effect of vmax in particle swarm optimisation with high dimension
International Journal of Bio-Inspired Computation
Predicted-velocity particle swarm optimization using game-theoretic approach
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
International Journal of Computer Applications in Technology
Artificial physics optimisation algorithm guided by diversity
International Journal of Computer Applications in Technology
International Journal of Computer Applications in Technology
Patterns and pathways of packing circles into a square
International Journal of Computer Applications in Technology
International Journal of Computing Science and Mathematics
Hi-index | 0.00 |
Simulated annealing (SA) algorithm is extremely slow in convergence, and the implementation and efficiency of parallel SA algorithms are typically problem-dependent. To overcome such intrinsic limitations, this paper presents a multi-agent SA (MSA) algorithm to address continuous function optimisation problems. In MSA, a population of agents run SA algorithm collaboratively, exploiting the velocity and position update formulas of particle swarm optimisation (PSO) algorithm for candidate solution generation. Our MSA algorithm can achieve significantly better intensification ability by taking advantage of the learning ability from PSO algorithm, meanwhile opposite velocity is introduced to keep MSA from premature stagnation. The MSA algorithm is population based, so it can be paralleled easily. Simulation experiments were carried on four benchmark functions, and the results show that MSA algorithm has good performance in terms of convergence speed and solution accuracy.