TEA - A C++ Library for the Design of Evolutionary Algorithms

dc.contributor.author	Emmerich, Michael	de
dc.contributor.author	Hosenberg, Rafael	de
dc.date.accessioned	2004-12-07T08:20:44Z
dc.date.available	2004-12-07T08:20:44Z
dc.date.created	2001	de
dc.date.issued	2001-10-29	de
dc.description.abstract	A library for the design of standard and non-standard EAs in C++ is described. The simple object-oriented design of the TEA library allows the fast configuration of new non-standard evolutionary algorithms. In TEA representation independent algorithms can be combined with non-standard genotypes. Complex genotypes can be build from existing simple genotypes. Furthermore, non-panmictic parallel population structures like neighbourhood and multipopulation EAs are supported. This paper introduces the main concepts of the TEA library. Examples illustrate how to build standard algorithms and how to design new kinds of algorithms and representations with TEA.	en
dc.format.extent	192069 bytes
dc.format.extent	394168 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5405
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15301
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 106	de
dc.subject.ddc	004	de
dc.title	TEA - A C++ Library for the Design of Evolutionary Algorithms	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2