文件列表:

TEA_Win_2.51\AUTHORS (261, 2003-02-26)
TEA_Win_2.51\Chromosome\teaCBitVector.cpp (19181, 2002-01-05)
TEA_Win_2.51\Chromosome\teaCESVector.cpp (32951, 2003-04-17)
TEA_Win_2.51\Chromosome\teaChromosome.cpp (1581, 2002-01-05)
TEA_Win_2.51\Chromosome\teaCIntVector.cpp (44564, 2003-04-17)
TEA_Win_2.51\Chromosome\teaCPermutation.cpp (11266, 2003-04-16)
TEA_Win_2.51\Chromosome\teaCVector.cpp (4016, 2002-01-05)
TEA_Win_2.51\Chromosome (0, 2005-03-04)
TEA_Win_2.51\COPYRIGHT (1602, 2003-01-08)
TEA_Win_2.51\Examples\teaCDiscreteExample.cpp (11662, 2003-04-21)
TEA_Win_2.51\Examples\teaCDiscreteExample.dsp (3949, 2003-04-24)
TEA_Win_2.51\Examples\teaCDiscreteExample.dsw (589, 2003-04-21)
TEA_Win_2.51\Examples\teaCDiscreteExample.h (1283, 2002-08-13)
TEA_Win_2.51\Examples\teaCESVectorExample.cpp (11889, 2005-01-18)
TEA_Win_2.51\Examples\teaCESVectorExample.dsp (3873, 2005-01-18)
TEA_Win_2.51\Examples\teaCESVectorExample.dsw (589, 2003-04-21)
TEA_Win_2.51\Examples\teaCESVectorExample.ncb (41984, 2005-01-18)
TEA_Win_2.51\Examples\teaCESVectorExample.opt (49664, 2005-01-18)
TEA_Win_2.51\Examples\teaCESVectorExample.plg (1429, 2005-01-18)
TEA_Win_2.51\Examples\teaICFSphereExample.cpp (3887, 2003-04-21)
TEA_Win_2.51\Examples\teaICFSphereExample.dsp (3873, 2005-03-03)
TEA_Win_2.51\Examples\teaICFSphereExample.dsw (589, 2003-04-21)
TEA_Win_2.51\Examples\teaICFSphereExample.plg (1456, 2005-03-03)
TEA_Win_2.51\Examples\teaIESPGAExample.cpp (6611, 2003-04-21)
TEA_Win_2.51\Examples\teaIESPGAExample.dsp (3913, 2003-04-24)
TEA_Win_2.51\Examples\teaIESPGAExample.dsw (583, 2003-04-21)
TEA_Win_2.51\Examples\teaIMultiChromoExample.cpp (10382, 2003-04-21)
TEA_Win_2.51\Examples\teaIMultiChromoExample.dsp (4043, 2003-04-24)
TEA_Win_2.51\Examples\teaIMultiChromoExample.dsw (595, 2003-04-21)
TEA_Win_2.51\Examples\teaIMultiChromoExample.h (1530, 2002-12-18)
TEA_Win_2.51\Examples\teaKnapsackExample.cpp (11580, 2003-04-21)
TEA_Win_2.51\Examples\teaKnapsackExample.dsp (3937, 2003-04-24)
TEA_Win_2.51\Examples\teaKnapsackExample.dsw (587, 2003-04-21)
TEA_Win_2.51\Examples\teaKnapsackExample.h (1251, 2002-08-13)
TEA_Win_2.51\Examples\teaMixedIntegerExample.cpp (13318, 2003-04-21)
TEA_Win_2.51\Examples\teaMixedIntegerExample.dsp (3985, 2003-04-24)
TEA_Win_2.51\Examples\teaMixedIntegerExample.dsw (595, 2003-04-21)
TEA_Win_2.51\Examples\teaMixedIntegerExample.h (1081, 2003-01-23)
TEA_Win_2.51\Examples\teaPESExample.cpp (7219, 2005-01-16)
TEA_Win_2.51\Examples\teaPESExample.dsp (3801, 2005-01-16)
... ...

************************************************************** * * * tea 2.51 (release date: 2003/03/05) * * * * A library for the use of standard and non-standard * * evolutionary algorithms * * * * * * * * (c) * * * ************************************************************** The TEA package implements a collection of algorithms for evolutionary algorithms. This is a short description for the installation and the enlargement of the tea-Library. A. System prerequisites B. Installation C. Examples D. Documentation E. Enlarge A. System prerequisites ======================= 1. C++ compiler Project files and tests are done with MS Visual C++. B. Installation =============== 1. Open the Working Space file which is placed in TEA directory. 2. Compile all Projects included there. All libraries and examples would be compiled. C. Examples =========== There is a Project File provided with each example. If you runned Installation as previously explaine, all of them would already be compiled. 1. The Tea Library --------------------------- BUILDING EVOLUTIONARY ALGORITHMS: --------------------------------- There are examples for building complete evolutionary algorithms using the TEA-objects. (1) teaPESExample: (STANDARD-REPRESENTATIONS) ------------------ An example for an standard Evolution Strategy. The algorithm is applied for the Minimisation of the Sphere-Model (Sum of Squares). It works on an real-valued ES-Vector representation with adaptive step-sizes for each parameter. (2) teaPGAExample: ------------------ An example for a standard Genetic Algorithm with roulette-wheel selection. The algorithm is applied for the Count-Ones-Problem and it minimises the number of Ones of a Bitstring-Chromosome. (3) teaIMultiChromoExample: (NON STANDARD-REPRESENTATION) --------------------------- An example for an representation with different types of chromosomes contained by one individual. Here the individual comprises a bit-vector and an real-valued-Vector. The objective is a mixed-binary sphere model, that is optimised with an Evolution Strategy. (4) teaCESVectorExample: (CHROMOSOMES) ------------------------ An ES-Vector-Chromosome is an real-valued vector representation. Besides the real-valued object parameters it offers an step-size as a strategy-parameter for each position, which is a positive real. The class that represents the Evolution Strategy-Vector-Chromosome and the corresponding Operator-Classes (Mutation and Recombination) offers various features. The example is an introduction in the specification of an ES-Vector with its specific operators. (5) teaCDiscreteExample: (NON-STANDARD-REPRESENTATION) ------------------------ With the use of integer-vector each discrete object is represented by a value. Every domain is constricted by a lower bound and an upper bound. In our case the number of letters of the alphabet define one bound. This is an example to demonstrate how constraints are applied on a self-constructed discrete problem. It is also an application of an Evolution Strategy. (6) teaPESPermutationExample: (NON-STANDARD-REPRESENTATION) ----------------------------- This is an example for the permutation-vector representation. It administer all necessary operations to apply mutation and recombination on permutations. Additionaly it provides to keep the permutation restrictions. The Traveling Salesman application is well suited to introduce in that non-standard-representation. The (15,100)-Evolution Strategy is been used to find an optimal solution. (7) teaKnapsackExample: (NON-STANDARD-REPRESENTATION) ----------------------- An example to demonstrate how the Knapsack-Problem can be solved with a collection of algorithms. In the application we use a (5,35)-Evolution Strategy on an integer-vector- representation. (8) teaMixedIntegerExample: (NON-STANDARD-REPRESENTATION) --------------------------- An example for building a metric based mixed integer representation with a real and integer and discrete array. The solution is been approximated by a (15,100)-Evolution Strategy. (9) teaIESPGAExampleExample: (NON-STANDARD-REPRESENTATION) ---------------------------- This is an example for a mixed representation of a GA population and an Evolution Strategy-Vector. (10) teaICFSphereExample: (STANDARD-REPRESENTATION) ------------------------- An example for the use of ISimple Individual to build more easear approximation applications with the use of Chromosome- Evolution Strategy. (11) teaPESIntExample: (STANDARD-REPRESENTATION) ---------------------- This is an example for integer-vector representation. In that application an Evoution Strategy is been applied. D. Documentation ================ --- E. Enlarge ========== (last update: 03/04/24)

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：