| 基于最小距离均衡系数的TSP问题求解算法 |
| |
| 引用本文： | 郏宣耀.基于最小距离均衡系数的TSP问题求解算法[J].洛阳大学学报,2005,20(2):16-19. |
| |
| 作者姓名： | 郏宣耀 |
| |
| 作者单位： | 宁波大红鹰职业技术学院,软件学院,浙江宁波,315175;浙江大学,宁波理工学院,信息科学与工程分院,浙江宁波,315100 |
| |
| 摘 要： | 提出了一种基于最小距离均衡系数的TSP求解算法,该算法在最近邻算法(NearestneighborAlgorithm)的基础上进行了改进,引入了距离均衡系数的概念,把优化方法从局部最优转化为全局最优,即将最短路径问题转化为最小距离均衡系数问题.仿真结果表明,该算法能够弱化导致最近邻法等算法性能下降的因素,从而在不同情况下保持算法的高有效性.
|
| 关 键 词： | 旅行商问题 最近邻算法 距离均衡系数 |
| 文章编号： | 1007-113X(2005)02-0016-04 |
| 修稿时间： | 2005年1月24日 |
An Algorithm for TSP Problem Based on Minimum Coefficient of Average Distance |
| |
| JIA Xuan-yao.An Algorithm for TSP Problem Based on Minimum Coefficient of Average Distance[J].Journal of Luoyang University,2005,20(2):16-19. |
| |
| Authors: | JIA Xuan-yao |
| |
| Institution: | JIA Xuan-yao~ |
| |
| Abstract: | A new algorithm for TSP problem based on minimum coefficients of average distance is presented. This algorithm is improved on the basis of the nearest-neighbor algorithm, and is turned from the partial optimization into the overall optimization, that is turning minimum distance issue into minimum coefficient of average distance issue. Experiments has indicated that this algorithm can weaken the factors that caused the decline of the performances of the nearest-neighbor algorithm and other algorithms. Thus it keeps a good performance of the algorithm in different cases. |
| |
| Keywords: | TSP problem nearest-neighbor algorithm minimum coefficient of average distance |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
