【摘要】 介绍了一种结合局部搜索策略的求解流动旅行商问题(TSP)的演化算法。该算法的主要思想是将局部搜索策略在邻域内搜索的快速性与演化方法在全局搜索上的鲁棒性结合起来,从而跳离局部最优。将该算法用于TSPLIB中部分TSP实例上的试验结果表明:与传统的各种求解TSP的演化方法相比,该算法在获得全局最优解的精确度上有了一定的改善。更多还原

【Abstract】 This paper introduces a new local evolutionary algorithm(LEA) and uses it to solve the traveling salesman problem.The algorithm incorporates speediness of local search algorithm in neighborhood search with robust quality of evolutionary algorithm in global search in order to obtain global optimum.The experimental results show that the algorithm is of potential to obtain global optimum and it is more accurate than other evolutionary methods for the TSP.更多还原