摘要
通过分析传统模拟退火算法的不足和可行的改进方案,提出了一个用于求解TSP问题的贪心模拟退火算法.新算法在改进的模拟退火算法的基础上结合改进的贪心算法,增加了算法的解的质量.实验表明,新的算法比传统的模拟退火算法和贪心算法有更优的解.
By analyzing the shortage of the traditional simulated annealing algorithm and the feasible improvement scheme,we proposed a greedy simulated annealing algorithm for solving TSP problem. The new algorithm combines the improved simulated annealing algorithm and the improved greedy algorithm,and improved the quality of the solution of the algorithm. Experimental test results show that the new algorithm has better solution than that of traditional simulated annealing algorithm.
出处
《河南工程学院学报（自然科学版）》
2015年第1期66-69,共4页
Journal of Henan University of Engineering：Natural Science Edition
关键词
模拟退火算法
贪心算法
TSP
组合优化
simulated annealing algorithm
greedy algorithm
TSP
combinatorial optimization
