Abstract
In this paper, a new Genetic Symbiosis Algorithm (GSA) is proposed based on the symbiotic concept found widely in ecosystems. Since in the conventional Genetic Algorithms (GA) reproduction is done using only the fitness function of each individual, there are some problems such as premature convergence to an undesirable solution at a very early stage of generation. In addition in some GA applications, it is sometimes required to maintain diversified solutions and to find out many locally optimal solutions. GSA is proposed to solve these problems by considering mutual symbiotic relations between Individuals. From simulations on optimizing a nonlinear function, it has been clarified that GSA can find more flexible solutions that can meet a variety of user's requests than the conventional methods.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE Conference on Evolutionary Computation, ICEC |
| Pages | 1377-1384 |
| Number of pages | 8 |
| Volume | 2 |
| Publication status | Published - 2000 |
| Event | Proceedings of the 2000 Congress on Evolutionary Computation - California, CA, USA Duration: Jul 16 2000 → Jul 19 2000 |
Other
| Other | Proceedings of the 2000 Congress on Evolutionary Computation |
|---|---|
| City | California, CA, USA |
| Period | 7/16/00 → 7/19/00 |
All Science Journal Classification (ASJC) codes
- Engineering(all)
- Computer Science(all)
- Computational Theory and Mathematics