On Modelling Evolutionary Algorithm Implementations through Co-operating Populations
Adamidis, Panagiotis/ Petridis, Vassilios/ Αδαμίδης, Παναγιώτης/ Πετρίδης, Βασίλειος
Institution and School/Department of submitter: | ΤΕΙ Θεσσαλονίκης |
Issue Date: | Sep-2002 |
Publisher: | Springer |
Citation: | International Conference Granada, Spain, 2011 Adamidis P., Petridis V. (2002) On Modelling Evolutionary Algorithm Implementations through Co-operating Populations. Lecture Notes in Computer Science 2439.Granada, Spain, September 7–11, 2002: Springer Berlin Heidelberg |
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. |
Description: | δημοσιεύσεις μελών--ΣΤΕΦ--Τμήμα Μηχανικών Πληροφορικής, 2011 |
URI: | http://195.251.240.227/jspui/handle/123456789/10359 |
ISSN: | 0302-9743 |
Other Identifiers: | http://link.springer.com/chapter/10.1007%2F3-540-45712-7_31 10.1007/3-540-45712-7_31 |
Appears in Collections: | Δημοσιεύσεις σε Περιοδικά |
Files in This Item:
There are no files associated with this item.
Please use this identifier to cite or link to this item:
This item is a favorite for 0 people.
http://195.251.240.227/jspui/handle/123456789/10359
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.