Synchronous Gravitational Search Algorithm vs Asynchronous Gravitational Search Algorithm: A Statistical Analysis

Ab Aziz, Nor Azlina and Ab Aziz, Kamarulzaman (2014) Synchronous Gravitational Search Algorithm vs Asynchronous Gravitational Search Algorithm: A Statistical Analysis. In: New Trends in Software Methodologies, Tools and Techniques. Frontiers in Artificial Intelligence and Applications, 265 . IOS Press, p. 160169. ISBN 978-1-61499-434-3; 978-1-61499-433-6

Full text not available from this repository.
Official URL: http://ebooks.iospress.nl/volumearticle/37310

Abstract

Gravitational search algorithm (GSA) is a new member of swarm intelligence algorithms. It stems from Newtonian law of gravity and motion. The performance of synchronous GSA (S-GSA) and asynchronous GSA (A-GSA) is studied here using statistical analysis. The agents in S-GSA are updated synchronously, where the whole population is updated after each member's performance is evaluated. On the other hand, an agent in A-GSA is updated immediately after its performance evaluation. Hence an agent in A-GSA is updated without the need to synchronize with the entire population. Asynchronous update is more attractive from the perspective of parallelization. The results show that both implementations have similar performance.

Item Type: Book Section
Additional Information: 13th International Conference on Intelligent Software Methodologies, Tools, and Techniques (SoMeT); Langkawi, MALAYSIA; SEP 22-24, 2014
Subjects: H Social Sciences > H Social Sciences (General)
Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions: Faculty of Engineering and Technology (FET)
Faculty of Management (FOM)
Depositing User: Ms Nurul Iqtiani Ahmad
Date Deposited: 13 Apr 2015 05:39
Last Modified: 13 Apr 2015 05:39
URI: http://shdl.mmu.edu.my/id/eprint/6174

Actions (login required)

View Item View Item