| 基于混合杂交的遗传算法求解旅行商问题 |
| |
| 引用本文： | 郑立平,郝忠孝.基于混合杂交的遗传算法求解旅行商问题[J].计算机工程,2005,31(20):168-169,172. |
| |
| 作者姓名： | 郑立平 郝忠孝 |
| |
| 作者单位： | [1]哈尔滨工业大学计算机科学与工程系,哈尔滨150001 [2]哈尔滨理工大学计算机科学与技术系,哈尔滨150080 |
| |
| 基金项目： | 黑龙江自然科学基金资助项目（F00-06） |
| |
| 摘 要： | 通过混合使用多种杂交算子，提出了一种求解旅行商问题的新型遗传算法，并给出了实验验证。通过实验用该算法求解了城市数为50到100不等的旅行商问题，获得了比其它算法更精确或更接近最优的解，表明了算法的有效性。
|
| 关 键 词： | 混合杂交 遗传算法 旅行商问题 |
| 文章编号： | 1000-3428（2005）20-0168-02 |
| 收稿时间： | 2004-09-20 |
| 修稿时间： | 2004-09-20 |
Genetic Algorithm Based on Hybrid Crossovers for TSP |
| |
| ZHENG Liping, HAO Zhongxiao.Genetic Algorithm Based on Hybrid Crossovers for TSP[J].Computer Engineering,2005,31(20):168-169,172. |
| |
| Authors: | ZHENG Liping HAO Zhongxiao |
| |
| Affiliation: | 1 .Department of Computer Science and Engineering, Harbin Institute of Technology, Harbin 150001 ; 2. Department of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080 |
| |
| Abstract: | A new genetic algorithm based on hybrid crossovers for traveling salesman problems is proposed, and an example is given to demonstrate the algorithm. The proposed algorithm by experiment is used to solve the traveling salesman problems with 50 to 100 cities and can find more accurate or closer-to-optimal solutions than other algorithms. This shows the effectiveness of the proposed algorithm. |
| |
| Keywords: | Hybrid crossovers Genetic algorithm Traveling salesman problem(TSP) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
