Abstract: Ant Colony Algorithm（ACA） is a stochastic optimization algorithm inspired by the behavior of ant looking for food.However，the standard ACA has some shortcomings，such as premature convergence，searching precision lowness and so forth.Based on the simulation of natural death process of 5% B-cell in biology clone selection，this paper proposes 8 kinds of updating algorithms according to intergeneration differential，theory of chaos，principle of mutation respectively，and selects the updated ants in terms of simulated annealing method.Numerical experiments show that the updating algorithm by using intergeneration differential and chaotic mutation is a good selection.Simultaneously，the updating effect is perfect when the updated ants are about 20%.This algorithm can effectively overcome the premature problem and speed up the convergence.

Key words: ant colony algorithm, clone selection, chaos, mutation, simulated annealing

摘要： 蚁群算法是根据蚂蚁的觅食行为而提出的随机优化算法，但其存在早熟收敛和搜索精度低等问题。模拟生物克隆选择中5%的B细胞自然消亡过程，在蚁群算法进化过程中分别基于代间差分、混沌理论、变异原理等方法设计了8种蚂蚁更新算法，按照模拟退火方法进行更新后蚂蚁的选择。通过数值试验得出结论：基于代间差分和混沌变异的蚂蚁更新算法是一种很好的选择，并且当性能较差的20%左右蚂蚁按照这种算法更新时效果较好。这种算法可以有效克服蚁群算法的早熟现象，能够加快收敛速度。

关键词: 蚁群算法, 克隆选择, 混沌, 变异, 模拟退火