A comparison of evolutionary algorithms for tracking time-varying recursive systems (Q1885154)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A comparison of evolutionary algorithms for tracking time-varying recursive systems |
scientific article; zbMATH DE number 2111343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of evolutionary algorithms for tracking time-varying recursive systems |
scientific article; zbMATH DE number 2111343 |
Statements
A comparison of evolutionary algorithms for tracking time-varying recursive systems (English)
0 references
28 October 2004
0 references
Summary: A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.
0 references
0.7108216881752014
0 references
0.7049875855445862
0 references
0.7016887664794922
0 references