NSACO A multiobjective nondominated sorting ant colony optimization algorithm for continuous and mixed-variable domains
Ant colony optimization was originally conceptualized to be an algorithm to solve combinatorial optimization problems. However, a lot of research over the years have shown that the ACO metaheuristic can be extended such that it can handle continuous optimization problems as well. In addition, ACO ca...
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | English |
| 出版事項: |
2010
|
| 主題: |