Evolutionary optimization for computationally expensive problems
Despite all the appealing features of Evolutionary Algorithms (EAs), thousands of calls to the analysis or simulation codes are often required to locate a near optimal solution. Two major solutions for this issue are: 1) to use computationally less expensive surrogate models, and 2) to use parallel...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
2009
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/19262 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|