We analyze the behavior of a simple genetic algorithm (GA) which is used to simulate the learning behavior of a population of interacting agents. Due to the fact that in this setup-contrary to traditional optimization setups-the fitness of a string depends on the current state of the population, exi
Genetic algorithms in random environments: two examples
✍ Scribed by Jean Bérard
- Book ID
- 106137648
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 200 KB
- Volume
- 133
- Category
- Article
- ISSN
- 1432-2064
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Due to some inherent interactions among diverse information sources, the classical weighted average method is not adequate for information fusion in many real problems. To describe the interactions, an intuitive and effective way is to use an appropriate nonadditive set function. Instead of the weig
The asymptotic behavior of a diffusive particle under the influence of an environment and of a dynamical feedback coupling is considered in the framework of a two-dimensional numerical simulation. The feedback is controlled by a Ž . memory term of strength l. A sufficient negative memory term l -0 o