摘要
分析了旅行商问题的各种求解方法的优缺点,并使用了一种基于人工免疫的遗传算法来求解旅行商问题。这种算法在传统遗传算法的全局随机搜索基础上,借鉴人工免疫中抗体的多样性保持策略,大大提高了算法的群体多样性,避免了遗传算法的过早收敛和局部搜索能力差的缺点。
In this paper, we analyzed different solutions of TSP as well as advantages and disadvantages correspondingly. During our design, we especially adopted a kind of genetic algorithm to deal with TSP which is based on artificial immunity. The traditional genetic algorithm used the random search all over. But the new algorithm draw lessons from the antibody’s variety in the artificial immunity and consequently improved the algorithm’s collective variety greatly. In addition, the new algorithm overcame the shortcomings of too early shrinkage and a bad ability to search partly.
出处
《孝感学院学报》
2005年第3期69-71,共3页
JOURNAL OF XIAOGAN UNIVERSITY
关键词
人工免疫
遗传算法
旅行商问题
artificial immunity
genetic algorithm
traveling salesman problem(TSP)