摘要
A new algorithm based on antibody immunodominance (AIDA) for TSP is explored. The main content of this paper is to explore how to produce the set of immunodominance and the superior antibodies. The experience proves that the algorithm has higher convergence speed and better solution compared with the corresponding genetic algorithm and is fit to solving complex problems.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 876-879 |
| 页数 | 4 |
| 期刊 | Lecture Notes in Computer Science |
| 卷 | 3611 |
| 期 | PART II |
| DOI | |
| 出版状态 | 已出版 - 2005 |
| 活动 | First International Conference on Natural Computation, ICNC 2005 - Changsha, 中国 期限: 27 8月 2005 → 29 8月 2005 |
学术指纹
探究 'An algorithm based on antibody immunodominance for TSP' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver