Multi-agent simulated annealing algorithm based on particle swarm optimisation algorithm

Citations Over TimeTop 10% of 2012 papers

Abstract

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.

Related Papers

• → Simulated annealing algorithm with adaptive neighborhood(2010)114 cited
• → Enhanced simulated-annealing-based algorithms and their applications to process planning in reconfigurable manufacturing systems(2011)78 cited
• → Simulated annealing artificial fish swarm algorithm(2010)25 cited
• Simulated Annealing, Weighted Simulated Annealing and Genetic Algorithm at Work(1998)
• → Mobile robot global path planning using hybrid modified simulated annealing optimization algorithm(2009)1 cited