2004
DOI: 10.1007/978-3-540-24688-6_84
|View full text |Cite
|
Sign up to set email alerts
|

Agent-Based Models and Platforms for Parallel Evolutionary Algorithms

Abstract: Abstract. The goal of the paper is to provide an overview of classical and agent-based models of parallel evolutionary algorithms. Agent approach reveals possibilities of unification of various models and thus allows for the development of platforms supporting the implementation of different PEA variants. Design considerations based on AgWorld and Ant.NET projects conclude the paper.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
7
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 7 publications
2
7
0
Order By: Relevance
“…It is related to and extends our previous publications regarding the implementation of effective tools for running population-based computational intelligence systems [4], especially using the agent paradigm [5], [6] in both parallel and distributed [7], as well as heterogeneous environments [8].…”
Section: Introductionsupporting
confidence: 53%
“…It is related to and extends our previous publications regarding the implementation of effective tools for running population-based computational intelligence systems [4], especially using the agent paradigm [5], [6] in both parallel and distributed [7], as well as heterogeneous environments [8].…”
Section: Introductionsupporting
confidence: 53%
“…8). Because of the space limitation in this section there are presented results obtained during solving problems CTP1-4 however general tendencies of results obtained during our experiments with the use of the rest of CTP problems (CTP5-8) are similar to those presented in this section.Presented in this paper results were obtained with the use of the following values of the most important energetic parameters: ω 15 (fundamental quantum of life energy transferred among agents): 100, ω 12 (reproduction threshold): Algorithm 3 meetFN(a 1 ∈ s 1 , a 2 ∈ s 2 ) in conEMAS1: trans f er(a 1 , a 2, i ω 15 a 2 r γ 1 ) 2: i ω 11 a 2 = min(i ω 11 a 2 , a 1 a 2 ) er(a 1 , a 2 , i ω 15 a 2 r γ 1 ) 5: end if 6: if a 2 a 1 then7: trans f er(a 2 , a 1 , i ω 15 a 1 r γ 1 ) 8: end if 9: if a 2 a 1 then10: checkLevelO f Domination(a 1 , a 2 ) 11:…”
supporting
confidence: 52%
“…In the case of (con)EMAS approach such distribution seems to be simple both from the conceptual as well as implementation point of view-since each island with all their agents can be run on separated computational unit [8] (present realization of (con)EMAS platform was designed for such computations-but presented here results are coming from computations run on one single computational unit. It is worth to mention that distribution of computations in the case of NSGA-II or SPEA2 algorithms can be more difficult since for instance nondominated sorting, or crowding mechanisms in NSGA-II assumes the global knowledge about the whole population, so communication mark-up can be really significant in the case of mentioned classical algorithms, or even potentially changes in definition of those algorithms can be required to adapt them to distributed and parallel computations [2].…”
Section: Discussionmentioning
confidence: 98%
“…1). Each island represents a kind of local environment, where agents can perform their tasks [5]. The environment is organized with the given topology, so islands are connected with directed paths.…”
Section: Multi-objective Optimizationmentioning
confidence: 99%