摘要
Based on the Antibody Clonal Selection Theory and the dynamic process of immune response, a novel Immune Forgetting Multiobjective Optimization Algorithm (IFMOA) is proposed. IFMOA incorporates a Pareto-strength based antigen-antibody affinity assignment strategy, a clonal selection operation, and a technique simulating the progress of immune tolerance. The comparison of IFMOA with other two representative methods, Multi-objective Genetic Algorithm (MOGA) and Improved Strength Pareto Evolutionary Algorithm (SPEA2), on different test problems suggests that IFMOA extends the searching scope as well as increasing the diversity of the populations, resulting in more uniformly distributing global Pareto optimal solutions and more integrated Pareto fronts over the tradeoff surface.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 399-408 |
| 页数 | 10 |
| 期刊 | Lecture Notes in Computer Science |
| 卷 | 3612 |
| 期 | PART III |
| DOI | |
| 出版状态 | 已出版 - 2005 |
| 活动 | First International Conference on Natural Computation, ICNC 2005 - Changsha, 中国 期限: 27 8月 2005 → 29 8月 2005 |
学术指纹
探究 'IFMOA: Immune Forgetting Multiobjective Optimization Algorithm' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver