Asymptotic analysis of computational multi-agent systems

Authors:
Aleksander Byrski;Robert Schaefer;Maciej Smołka;Carlos Cotta
Affiliations:
AGH University of Science and Technology, Kraków, Poland;AGH University of Science and Technology, Kraków, Poland;Jagiellonian University, Kraków, Poland;University of Málaga, Málaga, Spain
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 15
Cited 1

Stochastic global optimization methods. part 1: clustering methods

Mathematical Programming: Series A and B
Memetic algorithms: a short introduction

New ideas in optimization
The number partitioning problem: an open challenge for evolutionary computation?

New ideas in optimization
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
Agent-Oriented Model of Simulated Evolution

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Formal Memetic Algorithms

Selected Papers from AISB Workshop on Evolutionary Computing
Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm

Metaheuristics
A Study on the use of "self-generation'' in memetic algorithms

Natural Computing: an international journal
Exploring population geometry and multi-agent systems: a new approach to developing evolutionary techniques

Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Agent-Based Evolutionary and Immunological Optimization

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Stochastic Model of Evolutionary and Immunological Multi-Agent Systems: Mutually Exclusive Actions

Fundamenta Informaticae
Stochastic Model of Evolutionary and Immunological Multi-Agent Systems: Parallel Execution of Local Actions

Fundamenta Informaticae
An agent-based memetic algorithm (AMA) for nonlinear optimization with equality constraints

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues

IEEE Transactions on Evolutionary Computation

An agent-based model of hierarchic genetic search

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A stationary Markov chain model of the agent-based computation system EMAS is presented. The primary goal of the model is better understanding the behavior of this class of systems as well as their constraints. The ergodicity of this chain can be verified for the particular case of EMAS, thus implying an asymptotic guarantee of success (the ability of finding all solutions of the global optimization problem). The presented model may be further adapted to numerous evolutionary and memetic systems.