A novel multi-objective optimization algorithm based on artificial immune system
文献类型:会议论文
作者 | Li, Chun-Hua1; Zhu, Xin-Jan1; Hu, Wan-Qi2; Cao, Guang-Yi1 |
出版日期 | 1905-07-01 |
会议日期 | August 14, 2009 - August 16, 2009 |
会议地点 | Tianjian, China |
关键词 | Immune system - Evolutionary algorithms - Optimal systems - Pareto principle |
卷号 | 4 |
DOI | 10.1109/ICNC.2009.285 |
页码 | 569-574 |
英文摘要 | The traditional evolutionary algorithm (EA) for solving the multi-objective optimization problem (MOP) is difficult to accelerate convergence and keep the diversity of the achieved Pareto optimal solutions. A novel EA, i.e., Immune Multi-objective Optimization Algorithm (IMOA), is proposed to solve the MOP in this paper. The special evolutional mechanism of the artificial immune system (AIS) prevents the prematurity and quickens the convergence of optimization. The method combined by the random weighted method and the adaptive weighted method guarantee the acquired solutions to distribute on the Pareto front uniformly and widely. An external set for storing the Pareto optimal solutions is built up and updated by a novel approach. By graphical presentation and examination of selected performance metrics on two difficult test functions, the proposed IMOA is found to outperform four other algorithms in terms of finding a diverse set of solutions and converging near the true Pareto front. 漏 2009 IEEE. |
资助机构 | IEEE Computer Society |
会议录 | 5th International Conference on Natural Computation, ICNC 2009
![]() |
学科主题 | Multiobjective Optimization |
源URL | [http://ir.ipe.ac.cn/handle/122111/59504] ![]() |
作者单位 | 1.Fuel Cell Research Institute, Shanghai Jiao Tong University, Shanghai 200240, China 2.Institute of Process Engineering, Chinese Academy of Sciences, Beijing 100080, China |
推荐引用方式 GB/T 7714 | Li, Chun-Hua,Zhu, Xin-Jan,Hu, Wan-Qi,et al. A novel multi-objective optimization algorithm based on artificial immune system[C]. 见:. Tianjian, China. August 14, 2009 - August 16, 2009. |
入库方式: OAI收割
来源:过程工程研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。