A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems
In the past decades, many theoretical results related to the time complexity of evolutionary algorithms (EAs) on different problems are obtained. However, there is not any general and easy-to-apply approach designed particularly for population-based EAs on unimodal problems. In this paper, we first...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. - 1996. - 39(2009), 5 vom: 31. Okt., Seite 1092-106
|
|---|
| 1. Verfasser: |
Chen, Tianshi
(VerfasserIn) |
|---|
| Weitere Verfasser: |
He, Jun,
Sun, Guangzhong,
Chen, Guoliang,
Yao, Xin |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2009
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
|
|---|
| Schlagworte: | Journal Article
Research Support, Non-U.S. Gov't |
|---|