Cheating for problem solving: a genetic algorithm with social interactions

Lahoz-Beltra, Rafael; Ochoa, Gabriela; Aickelin, Uwe

Abstract

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.

Citation

Lahoz-Beltra, R., Ochoa, G., & Aickelin, U. (in press). Cheating for problem solving: a genetic algorithm with social interactions.

• Conference Name: GECCO '09: Proceedings of the Genetic and Evolutionary Computation Conference
• End Date: Jul 12, 2009
• Acceptance Date: Jan 1, 2009
• Deposit Date: Jun 17, 2016
• Peer Reviewed: Peer Reviewed
• Keywords: Genetic algorithms, social interaction, game theory, knapsack problem
• Public URL: https://nottingham-repository.worktribe.com/output/705215
• Publisher URL: http://dl.acm.org/citation.cfm?id=1570013
• Related Public URLs: http://www.sigevo.org/gecco-2009/; http://ima.ac.uk/papers/beltra2009.pdf
• Additional Information: doi:10.1145/1569901.1570013