| 基于Elitism策略的改进免疫遗传算法求解TSP问题 |
| |
| 引用本文： | 王曙霞,涂俊英,郑艳君.基于Elitism策略的改进免疫遗传算法求解TSP问题[J].数字社区&智能家居,2010(1). |
| |
| 作者姓名： | 王曙霞 涂俊英 郑艳君 |
| |
| 作者单位： | 孝感学院计算机与信息科学学院; |
| |
| 基金项目： | 湖北省教育厅优秀中青年人才项目资助(Q200726003) |
| |
| 摘 要： | TSP问题是一类典型的NP完全问题。作者结合Elitism策略提出了一种新的改进免疫遗传算法。该算法既保留了遗传算法的全局随机搜索的优点,又避免了免疫遗传算法的早熟、收敛速度慢等缺点。经仿真实验对比,在求解TSP问题时,该文提出的新算法具有收敛速度快及动态收敛性好的优点。
|
| 关 键 词： | Elitism策略 遗传算法 免疫遗传算法 旅行商问题 优化 |
A Modified Immune Genetics Algorithm with Elitism Strategy for Traveling Salesman Problems |
| |
| WANG Shu-xia,TU Jun-ying,ZHENG Yan-jun.A Modified Immune Genetics Algorithm with Elitism Strategy for Traveling Salesman Problems[J].Digital Community & Smart Home,2010(1). |
| |
| Authors: | WANG Shu-xia TU Jun-ying ZHENG Yan-jun |
| |
| Affiliation: | School of Computer and Information Science;Xiaogan University;Xiaogan 432100;China |
| |
| Abstract: | In this paper, a new modified immune genetics algorithm with elitism is designed to solve traveling salesmen problems(TSP).The proposed algorithm holds the global searching, and avoids the shortcomings of the immune genetics algorithm, such as converging slowly and precocity.As the experimentations show, the new algorithm has quick convergence speed and better dynamic convergence for solve TSP. |
| |
| Keywords: | elitism strategy genetics algorithm immune genetics algorithm traveling salesman problems optimization |
| 本文献已被 CNKI 等数据库收录！ |
