搜索资源列表
TS-SA
- 禁忌搜索和模拟退火相结合的算法，解决TSP问题。注：31城市。-Tabu search and simulated annealing to a combination of algorithms to solve TSP. Note: The 31 cities.
TSP_TS
- 基于禁忌搜索的求解TSP问题。问题为31个城市的寻优路径，采用GLover提出的简单禁忌搜索算法。设置禁忌表，避免陷入循环，实现全局的最优。-Based on Tabu Search for TSP. Route optimization problem in 31 cities, using a simple tabu search algorithm GLover proposed. Set tabu list, to avoid
TS
- 禁忌搜索算法解决TSP问题,以中国31省会城市的最短旅行路径为例来说明TS算法的优越性-TS algorithm to solve TSP problem
83268749TS-SA
- 31个城市的tsp问题，并没有改进，如果你有改进过的请联系我(31 cities tsp problem, and no improvement, if you have improved please contact me)
tabu_search
- 基禁忌搜索于31城市TSP问题,Base tabu search in the 31 city TSP problem(Base tabu search in the 31 city TSP problem)
TS_tsp
- 利用matlab软件，应用禁忌搜索算法解决31个城市的TSP问题(Using Matlab Software, Applying Tabu Search Algorithm to Solve TSP Problems in 31 Cities)
jinji
- 禁忌搜索算法，主要为解决TSP问题，选取31个城市，目标是31个城市的路径最短化(Tabu search algorithm, mainly to solve the TSP problem, select 31 cities, the goal is the shortest path of 31 cities.)