Analysis of learning-based multi-agent simulated annealing algorithm for function optimisation problems
by Yiwen Zhong; Juan Lin; Hui Yang; Hui Zhang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 4, 2013

Abstract: Canonical simulated annealing (SA) algorithm is extremely slow in convergence, and the implementation and efficiency of parallel SA algorithms are typically problem-dependent. Multi-agent SA (MSA) algorithms, which use learned knowledge to guide its sampling, can overcome such intrinsic limitations naturally. Learning strategy, which decides the representation, selection, and usage of knowledge, may affect the performance of MSA algorithms significantly. Using the current population as learned knowledge, we design three different knowledge selection schemes, selecting from better agents, selecting from worse agents and selecting from all agents randomly, to select knowledge to guide sampling. A differential perturbation operator is designed to generate candidate solution from the selected knowledge. Comparison was carried on four widely used benchmark functions, and the results show that learning-based MSA algorithm has good performance in terms of convergence speed and solution accuracy. Furthermore, simulation results also show that even learning from worse agents significantly outperforms not learning at all.

Online publication date: Sat, 10-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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