旅行商问题的人工免疫算法  

An Artificial Immune Algorithm for Travelling Salesman Problem

作　　者：李茂军[1] 舒宜 童调生[3] 

机构地区：[1]长沙电力学院电力工程系,长沙410077 [2]株洲电业局,株州412000 [3]湖南大学电气与信息工程学院,长沙410082

出　　处：《计算机科学》2003年第3期80-82,89,共4页Computer Science

基　　金：国家教育部博士点基金(98053205)

摘　　要：This paper presents an Artificial Immune Algorithm (AIA)simulating the biological immune systems, andoffers its basic principle and approach. Comparing AIA with Genetic Algorithm (GAs)simulating the biological evolu-tion process, the paper points out that the method producing new antibodies in AIA is more versatile than the oneproducing new individuals in GAs. AIA reflects mechanism of natural selection better than GAs does, as AIA selectseffective antibodies from all antibodies by the appetency between an antibody and an antigen and by the repulsion be-tween an antibody and another, while GAs selects new individuals of next colony by the proportion of individual fit-ness. For Travel Salesman Problem (TSP), this paper brings forward how to describe antibodies artificially, how toproduce original antibodies, how to compute the appetency between an antibody and an antigen and the repulsion be-tween an antibody and another, and works out several artificial immune operators producing new antibod-ies. Simulating examples show that AIA is a very effective method for TSP.This paper presents an Artificial Immune Algorithm (AIA)simulating the biological immune systems, and offers its basic principle and approach. Comparing AIA with Genetic Algorithm (GAs)simulating the biological evolutionprocess, the paper points out that the method producing new antibodies in AIA is more versatile than the one producing new individuals in GAs. AIA reflects mechanism of natural selection better than GAs does, as AIA selects effective antibodies from all antibodies by the appetency between an antibody and an antigen and by the repulsion betweenan antibody and another, while GAs selects new individuals of next colony by the proportion of individual fitness.For Travel Salesman Problem (TSP), this paper brings forward how to describe antibodies artificially, how to produce original antibodies, how to compute the appetency between an antibody and an antigen and the repulsionbetween an antibody and another, and works out several artificial immune operators producing new antibodies.Simulating examples show that AIA is a very effective method for TSP.

关 键 词：旅行商问题 人工免疫算法 有序组合优化问题 TSP问题 遗传算法 

分 类 号：O224[理学—运筹学与控制论]