| 基于HGA的最小旅行时间多旅行商问题研究 |
| |
| 引用本文： | 周辉仁,唐万生,魏颖辉.基于HGA的最小旅行时间多旅行商问题研究[J].控制工程,2010,17(2). |
| |
| 作者姓名： | 周辉仁 唐万生 魏颖辉 |
| |
| 作者单位： | 1. 天津大学,系统工程研究所,天津,300072
2. 辽宁科技学院,管理系,辽宁,本溪,117022 |
| |
| 基金项目： | 辽宁省教育厅科研课题基金资助项目(20060439);;中国博士后科学基金资助项目(20090450759) |
| |
| 摘 要： | 为了解决最小化旅行时间的多旅行商一类问题,提出了一种递阶遗传算法和矩阵解码方法。该算法根据问题的特点,采用一种递阶编码方案,此编码与多旅行商问题一一对应。用递阶遗传算法优化多旅行商问题不需设计专门的遗传算子,操作简单,并且解码方法适于求解距离矩阵对称和距离矩阵非对称的多旅行商问题。计算结果表明,递阶遗传算法是有效的,能适用于优化最小化完成时间的多旅行商问题。
|
| 关 键 词： | 递阶遗传算法 多旅行商问题 最小完成时间 解码方法 |
On Multiple Traveling Salesman Problem with Minimum Completion Time Based on Hierarchical Genetic Algorithm |
| |
| ZHOU Hui-ren,TANG Wan-sheng,WEI Ying-hui.On Multiple Traveling Salesman Problem with Minimum Completion Time Based on Hierarchical Genetic Algorithm[J].Control Engineering of China,2010,17(2). |
| |
| Authors: | ZHOU Hui-ren TANG Wan-sheng WEI Ying-hui |
| |
| Affiliation: | 1.Institute of Systems Engineering/a>;Tianjin University/a>;Tianjin 300072/a>;China/a>;2.Department of Management/a>;Liaoning Institute of Science and Technology/a>;Benxi 117022/a>;China |
| |
| Abstract: | To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time,a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.The coding method was simple and could effectively reflect the traveling policy,and the methods of crossover and mutation are not special to design.It is fit for solving symmetric and asymmetric MTSP.The computational results show that the hierarchical genetic algorithm is efficient and fit for minimum completion time traveling sales... |
| |
| Keywords: | hierarchical genetic algorithm MTSP problem minimum completion time decoding method |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
