Cheating for problem solving: a genetic algorithm with social interactions

Lahoz-Beltra, Rafael and Ochoa, Gabriela and Aickelin, Uwe (2009) Cheating for problem solving: a genetic algorithm with social interactions. In: GECCO '09: Proceedings of the Genetic and Evolutionary Computation Conference, 8-12 July 2009, Montreal, Canada.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview


We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary role of social systems and its possible application as a non-genetic new step in evolutionary algorithms. In biological populations, i.e. animals, even human beings and microorganisms, social interactions often affect the fitness of individuals. It is conceivable that the perturbation of the fitness via social interactions is an evolutionary strategy to avoid trapping into local optimum, thus avoiding a fast convergence of the population. We model the social interactions according to Game Theory. The population is, therefore, composed by cooperator and defector individuals whose interactions produce payoffs according to well known game models (prisoner's dilemma, chicken game, and others). Our results on Knapsack problems show, for some game models, a significant performance improvement as compared to a standard genetic algorithm.

Item Type: Conference or Workshop Item (Paper)
Additional Information: doi:10.1145/1569901.1570013
Keywords: Genetic algorithms, social interaction, game theory, knapsack problem
Schools/Departments: University of Nottingham, Ningbo Campus > Faculty of Science and Engineering > Division of Computer Science
University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Related URLs:
Depositing User: Aickelin, Professor Uwe
Date Deposited: 17 Jun 2016 10:41
Last Modified: 26 Sep 2016 15:11

Actions (Archive Staff Only)

Edit View Edit View