Camelia Chira
ABSTRACT
Evolutionary algorithms require efficient recombination and selection mechanisms in order to produce high-quality solutions. In order to guide recombination a geometrical structure of the population is introduced. The aim of this paper is to explore connections between population geometry and individual interactions inducing autonomy, communication and reactivity. Each individual in the population acts as an autonomous agent with the goal of optimizing its fitness. In this process, each individual is able to communicate and select a mate for recombination. The introduced paradigm is illustrated by an evolutionary technique relying on a new population model and agent-based selection for recombination strategy. Search operators are asynchronously applied making the proposed approach more realistic. Numerical experiments indicate the potential of the proposed evolutionary agent-driven technique.
- Alba E., Giacobini M., Tomassini M., Romero S. 2002, Comparing Synchronous and Asynchronous Cellular Genetic Algorithms. J.J. Merelo et al. (eds.), Proceedings of the Parallel Problem Solving from Nature VII, Granada (SP), LNCS 2439, p. 601--610. Google Scholar
Digital Library
- Bradshow, J.M. 1997. An Introduction to Software Agents, in Software Agents, J.M. Bradshow, MIT Press. Google ScholarDigital Library
- Chira, O., Chira, C., Tormey, D., Brennan, A., Roche, T. 2006. An Agent-Based Approach to Knowledge Management in Distributed Design, Special issue on E-Manufacturing and web-based technology for intelligent manufacturing and networked enterprise interoperability, Journal of Intelligent Manufacturing, Vol. 17, No. 6, Springer Verlag, pp. 737--750.Google ScholarCross Ref
- Golden, B.L., Assad, A.A. 1984. A decision-theoretic framework for comparing heuristics, European J. of Oper. Res., Vol. 18, pp. 167--171.Google ScholarCross Ref
- Jennings, N.R. 2000. On Agent-Based Software Engineering. Artificial Intelligence Journal, 117 (2), pp. 277--296. Google ScholarDigital Library
- Nwana, H., Lee, L., Jennings, N. 1996. Coordination in Software Agent Systems, BT Technology Journal, Vol. 14, No. 4, pp. 79--88.Google Scholar
- Russel, S., Norvig, P. 2002. Artificial Intelligence: A Modern Approach, Prentice Hall, 2nd edition. Google ScholarDigital Library
- Tang, K., Yao, X., Suganthan, P.N., MacNish, C., Chen, Y.P., Chen, C.M., Yang, Z. 2007. Benchmark Functions for the CEC'2008 Special Session and Competition on Large Scale Global Optimization. Technical Report, Nature Inspired Computation and Applications Laboratory, USTC, China, http://nical.ustc.edu.cn/cec08ss.php.Google Scholar
- Wooldrige, M. 2002. An Introduction to Multiagent Systems, Wiley & Sons. Google ScholarDigital Library
Index Terms
- Exploring population geometry and multi-agent systems: a new approach to developing evolutionary techniques
Recommendations
Hybrid Multi-population Collaborative Asynchronous Search
HAIS '08: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence SystemsThe paper explores connections between population topology and individual interactions inducing autonomy, communication and learning. A Collaborative Asynchronous Multi-Population Evolutionary (CAME) model is proposed. Each individual in the ...
A novel differential evolution algorithm with adaptive of population topology
ICICA'12: Proceedings of the Third international conference on Information Computing and ApplicationsDifferential evolution is a simple and efficient algorithm. Although it is well known that the population structure has an important influence on the behavior of EAs, there are a few works studying its effect in DE algorithms. In this paper, a novel ...
The choice of the offspring population size in the (1,λ) EA
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computationWe extend the theory of non-elitist evolutionary algorithms (EAs) by considering the offspring population size in the (1,λ) EA. We establish a sharp threshold at λ = log{\frac{e}{e-1}} n ≈5 log10 n between exponential and polynomial running times on ...
Comments