| 基于GA的MTSP问题实现 |
| |
| 引用本文： | 邱军林,周永权,张亚红. 基于GA的MTSP问题实现[J]. 微计算机信息, 2010, 0(6) |
| |
| 作者姓名： | 邱军林 周永权 张亚红 |
| |
| 作者单位： | 淮阴工学院;广西民族大学; |
| |
| 基金项目： | 基金申请人:周永权;项目名称:变参数自适应代数神经网络及应用;基金颁发部门:国家自然科学基金(60461001) |
| |
| 摘 要： | 多旅行商问题(Multiple Traveling Salesperson Problem,简称MTSP)是讨论m位旅行商如何访问n座城市,要求每个城市都被访问,且仅被访问一次,求得所有旅行商经过的路径和最小。本文通过对MTSP特点的分析,依据遗传算法的基本思想,对编码和遗传算子进行合理选取。通过仿真表明,该优化方法能够取得较优解。
|
| 关 键 词： | 遗传算法 MTSP问题 染色体 |
The MTSP problem solving based on GA |
| |
| QIU Jun-lin ZHOU Yong-quan ZHANG Ya-hong. The MTSP problem solving based on GA[J]. Control & Automation, 2010, 0(6) |
| |
| Authors: | QIU Jun-lin ZHOU Yong-quan ZHANG Ya-hong |
| |
| Abstract: | The Multiple Traveling Salesperson Problem is to discuss how m salespersons to visit a set of n locations,each of them is visited exactly only once while minimizing the total distance traveled by the salesperson.This paper analyzes the feature of MTSP,based on the basic idea of Genetic Algorithm,which selects the reasonable coding and genetic operators.The experimental results show that we can obtain a good solution from this method. |
| |
| Keywords: | Genetic algorithm MTSP problem Chromosome |
| 本文献已被 CNKI 等数据库收录！ |
|
