Investigating a new paradigm for designing evolutionary optimisation algorithms using social behaviour evolution
Pages 747 - 750
Abstract
This paper describes a new approach for building evolutionary optimisation algorithms inspired by concepts borrowed from evolution of social behaviour. The proposed approach utilises a set of behaviours used as operators that work on a population of individuals. These behaviours are used and evolved by groups of individuals to enhance a group adaptation to the environment and to other groups. Each group has two sets of behaviours: one for intra-group interactions and one for inter-group interactions. These behaviours are evolved using mathematical models from the field of evolutionary game theory. This paper describes the proposed paradigm and starts studying its characteristics by building a new evolutionary algorithm and studying its behaviour. The algorithm has been tested using a benchmark problem generator with promising initial results, which are also reported. We conclude the paper by identifying promising directions for the continuation of this research.
References
[1]
Blackwell, T. and Branke, J. Multi-swarm optimization in dynamic environments. Applications of Evolutionary Computing, 3005. 489--500.
[2]
Branke, J., Kaussler, T., Schmidt, C. and Schmeck, H. A multi-population approach to dynamic optimization problems. Evolutionary Design and Manufacture (2000). 299--307.
[3]
Cedeno, W. and Vemuri, V. R. On the use of niching for dynamic landscapes. Proceedings of 1997 Ieee International Conference on Evolutionary Computation (Icec '97). 361--366.
[4]
De Jong, K. A. Evolutionary computation : a unified approach. MIT Press, Cambridge, 2006.
[5]
Hamilton, W. D. The genetical evolution of social behaviour I & II. Journal of Theoretical Biology, 7 (1964). 1--52.
[6]
Hofbauer, J. and Sigmund, K. Evolutionary games and population dynamics. Cambridge University Press, Cambridge 1998.
[7]
Lahoz-Beltra, R., Ochoa, G. and Aickelin, U., Cheating for problem solving: a genetic algorithm with social interactions. in Genetic and Evolutionary Computation Conference (GECCO 2009), (Montreal, Canada, 2009), ACM, 811--818.
[8]
Li, C., Yang, S., Nguyen, T., Yu, E., Yao, X., Jin, Y., Beyer, H. and Suganthan, P. Benchmark generator for CEC'2009 competition on dynamic optimization, University of Leicester, University of Birmingham, Nanyang Technological University, Tech. Rep, 2008.
[9]
Maynard Smith, J. and Price, G. The logic of animal conflict. Nature, 246 (1973). 15--18.
[10]
Potter, M. A. and De Jong, K. A. Cooperative coevolution: An architecture for evolving coadapted subcomponents. Evolutionary Computation, 8 (1). 1--29.
[11]
Taylor, P. and Jonker, L. Evolutionary stable strategies and game dynamics. Mathematical Biosciences, 40 (1978). 145--156.
[12]
Thomas L. Vincent and Brown, J. S. Evolutionary game theory, natural selection, and Darwinian dynamics Cambridge University Press, Cambridge, 2005.
[13]
Yang, S., Ong, Y.-S. and Jin, Y. (eds.). Evolutionary computation in dynamic and uncertain environments Springer, Berlin 2007.
Index Terms
- Investigating a new paradigm for designing evolutionary optimisation algorithms using social behaviour evolution
Recommendations
A social behaviour evolution approach for evolutionary optimisation
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationEvolutionary algorithms were originally designed to locate basins of optimum solutions in a stationary environment. Therefore, additional techniques and modifications have been introduced to deal with further requirements such as handling dynamic ...
Social adaptive groups: a new approach for evolutionary optimisation based on social behaviour evolution
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationThis paper describes a new approach for building evolutionary optimisation algorithms inspired by concepts borrowed from evolution of social behaviour. The proposed approach utilises a set of behaviours used as operators that work on a population of ...
Investigating uncertainty propagation in surrogate-assisted evolutionary algorithms
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceUncertainty propagation is a technique to incorporate individuals with uncertain fitness estimates in evolutionary algorithms. The Surrogate-Assisted Partial Order-Based Evolutionary Optimisation Algorithm (SAPEO) uses uncertainty propagation of fitness ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2011
1548 pages
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 July 2011
Check for updates
Author Tags
Qualifiers
- Tutorial
Conference
GECCO '11
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 79Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in