求解TSP问题的局部最优免疫优势克隆选择算法

o enhance the efficiency of artificial immune algorithms for Traveling Salesman Problem (TSP), A novel algorithm based on Local Optimization Immunodominance Clonal Selection Algorithm is proposed., The affinity maturation of antibody is enhanced by local Optimization Immunodominance operating, clone expansion and adaptive dynamic hyper mutation and so on. Simultaneously, adjusting mechanism of antibody concentration and antibody clonal deletion are introduced into this algorithm, which enhances the diversity of antibody and get the balance between the depth and breadth research. Simulation testing illustrates that the algorithm has a remarkable quality of convergence velocity and global convergence reliability.