摘要
免疫算法已开始成为计算智能研究的一个热点.本文提出了一种基于免疫识别的免疫算法,该算法的设计借鉴了生物免疫识别中的非选择机制,其求解思想与现有优化方法不同,它是通过在解空间中不断识别、选择出劣解并加以排除来获得优解.本文详细介绍了该算法的设计,从理论上分析了算法的收敛性能和时间复杂度,并针对TSP问题设计了相应的验证实验.理论分析和实验结果都表明该算法具有很强的问题求解能力.
Immune algorithm has become a hotspot in the area of computational intelligence. We proposed an immune algorithm based on immune recognition(IAIR) .The design of IAIR was inspired by the negative selection mechanism in the biological immune system and its idea was different with current optimization methods in that it got the good solution by excluding bad solutions. This paper introduced in detail the design of IAIR, analyzed its ability and time complexity. We also designed experiments to solve the TSP problem.The theoretical analysis and experimental results showed that IAIR had a good ability of problem solving.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2002年第12期1840-1844,共5页
Acta Electronica Sinica
基金
国家自然科学基金(No.69971022)
国家博士点基金
安徽省自然科学基金项日(No.00043106)
