Abstract
A drawback of using genetic algorithms (GAs) to train recurrent neural networks is that it takes a large number of generations to evolve the networks into an optimal solution. In order to reduce the number of generations taken, the Lamarckian learning mechanism and the Baldwinian learning mechanism are embedded into a cellular GA. This paper investigates the effects of these two learning mechanisms on the convergence performance of the cellular GA. The criteria that make learning useful to GAs are also discussed. The results show that the Lamarckian mechanism is able to assist the cellular GA, while the Baldwinian mechanism fails to do so. In addition to reducing the number of generations taken, we have found that it is also possible to reduce the time taken by embedding learning into the cellular GA in an appropriate manner.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE Conference on Evolutionary Computation, ICEC |
| Publisher | IEEE |
| Pages | 617-621 |
| Number of pages | 5 |
| Publication status | Published - 1 Jan 1997 |
| Event | Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, United States Duration: 13 Apr 1997 → 16 Apr 1997 |
Conference
| Conference | Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 |
|---|---|
| Country/Territory | United States |
| City | Indianapolis, IN |
| Period | 13/04/97 → 16/04/97 |
ASJC Scopus subject areas
- Computer Science(all)
- Engineering(all)