摘要
旅行商问题(TravellingSalesmanProblemTSP)是一个典型的组合优化难题,论文提出一种求解旅行商问题的高效混合遗传算法。该算法结合遗传算法和2-opt邻域搜索优化技术,并针对旅行商问题的特点,提出K近邻点集以缩减搜索空间从而加快求解速度。基于典型实例的仿真结果表明,此算法的求解效率比较高。
Travelling Salesman Problem(TSP)is a classic NP-Hard problem in combination.An efficient hybrid genetic algorithms for TSP is presented in this paper.The algorithm combines genetic algorithms and2-opt local search opti-mization,in order to speed up the computation,K Nearest Neighbors Sets is proposed to decrease the search space ac-cording to the characteristic of TSP.The simulations based on typical benchmarks prove that this algorithm is efficient.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第22期67-70,共4页
Computer Engineering and Applications
