Title: A genetic algorithm that simulates social behaviour

Authors: Nagham Azmi AL-Madi, Ahamad Tajudin Khader

Addresses: University Sains Malaysia, Penang, Malaysia. ' University Sains Malaysia, Penang, Malaysia

Abstract: Genetic algorithms (GAs), as general search models, have proved its success in several applications, however recently, several researchers have argued that they have slow convergence; this slowness is due to the randomness in all their operations. Therefore, recent researches have employed structured populations, in order to eliminate randomness, such as island models, cellular model, multinational evolutionary algorithms, etc. In this paper, a social based GA is introduced; this model is trying to mimic the actual social behaviour and the actual death and birth process. The authors will restrict the recombination for males to the only permitted females. The authors| motivation to such an approach is that they expect the nature to be more robust and optimal; hence, the objectives of this work are to study the effects of these social rules and customs on the standard GA and to investigate its effects on the speed of convergence of GA. The primary results show a faster convergence than a standard GA and a controlled diffusion of individuals and hence better spanning of the search space.

Keywords: genetic algorithms; GAs; evolutionary algorithms; EAs; social behaviour; social rules; social customs; search space.

DOI: 10.1504/IJITST.2009.023906

International Journal of Internet Technology and Secured Transactions, 2009 Vol.1 No.3/4, pp.228 - 235

Published online: 18 Mar 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article