Multi-agent simulated annealing algorithm based on particle swarm optimisation algorithm Online publication date: Fri, 01-Jun-2012
by Yiwen Zhong; Jing Ning; Hui Zhang
International Journal of Computer Applications in Technology (IJCAT), Vol. 43, No. 4, 2012
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook