Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
On Modelling Evolutionary Algorithm Implementations through Co-operating Populations
| |
|
On Modelling Evolutionary Algorithm Implementations through Co-operating Populations
Panagiotis Adamidis5 and Vasilios Petridis6
| (5) |
Dept of Informatics, Technological Educational Institute of Thessaloniki, 541 01, Greece |
| (6) |
Dept of Electrical & Computer Eng., Aristotle University of Thessaloniki, 540 06, Greece |
Abstract
In this paper we present a framework for modelling Simple and Parallel Evolutionary Algorithm implementations as Co-operating
Populations. Using this framework, a method called Co-operating Populations with Different Evolution Behaviours (CoPDEB), for generalizing and improving the performance of Parallel Evolutionary Algorithms (PEAs) is also presented. The main idea
of CoPDEB is to maintain a number of populations exhibiting different evolution behaviours. CoPDEB was tested on three problems
(the optimization of a real function, the TSP problem and the problem of training a Recurrent Artificial Neural Network),
and appears to significantly increase the problemsolving capabilities over PEAs with the same evolution behaviour on each
population. This paper also studies the effect of the migration rate (Epoch) and the population size on the performance of both PEAs and CoPDEB.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|