Multi-agent simulated annealing algorithm based on differential perturbation for protein structure prediction problems
by Yiwen Zhong; Juan Lin; Qingliang Du; Limei Wang
International Journal of Computer Applications in Technology (IJCAT), Vol. 51, No. 3, 2015

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 protein structure prediction problems based on the 2D off-lattice model. Inspired by the learning ability of the mutation operators in differential evolution algorithm, three differential perturbation (DP) operators are defined to generate candidate solutions collaboratively. This paper also analyses the effect of different sampling grain, which determines how many dimensions will be perturbed when a candidate solution is generated. The proposed MSA algorithm can achieve better intensification ability by taking advantage of the learning ability from DP operators, which can adjust its neighbourhood structure adaptively. Simulation experiments were carried on four artificial Fibonacci sequences, and the results show that the performance of MSA algorithm is promising.

Online publication date: Wed, 13-May-2015

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 Computer Applications in Technology (IJCAT):
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