搜索资源列表
TS
- 禁忌搜索算法解决TSP问题,以中国31省会城市的最短旅行路径为例来说明TS算法的优越性-TS algorithm to solve TSP problem
Ant-colony-algorithm
- 主要用蚁群算法用matlab实现，解决城市之间最短路径问题-Ant colony algorithm to achieve the TSP
36063823afsa2
- 摘 要:在分析人工鱼群算法存在不足的基础上,对人工鱼群算法加以改进,提出了一种改进型人工鱼群算 法。该算法提高了全局搜索能力和收敛速度,并用于求解具有变量边界约束的非线性复杂函数最优化问题。 仿真结果表明,改进后的人工鱼群算法具有精度高、搜索速度快等特点,是一种求解复杂函数全局最优化的智 能算法-Combinatorial optimization problems through the application of artificial fish-swarm algorithm to imi
tspdata
- 几个TSP数据，自己整理好的，可直接粘贴到MATLAB程序中-Several TSP data, organize their own good, and can be pasted directly into MATLAB program
143069211sa-for-tsp-1
- This is matlab implementation for finding shortest path by using simulated annealing
ant11
- TSP解答。是智能优化算法的重要问题，采用了蚁群优化算法。-TSP solution. It is an important problem of intelligent optimization algorithm, the ant colony optimization algorithm
ABC
- 蜂群算法解决TSP的问题，以31个城市为例-Problem solving tsp with bee colony algorithm to coordinate data 31 cities in China as a case
SA-TSP
- Simulated Annealing (SA) is the oldest probabilistic meta-heuristic algorithm and one of the first algorithms having ability to avoid being trapped in local minima. It is inspired by the process of annealing in metallurgy. In this process a m
simulated-annealing-master
- deal with TSP question
EWT20150721
- EWT算法，参考文献：IEEE, TSP, Empirical Wavelet Transform-EWT, ref: IEEE TSP, Empirical Wavelet Transform
gatsp1
- 采用遗传算法ga解决旅行商问题tsp，是用MATLAB语言编写的，并且注释很详细。-Ga genetic algorithm to solve the traveling salesman problem tsp, with MATLAB language, and very detailed comments.
aco2004
- Ant colony system 1, optimization algorithm to solve TSP problem
TR06-143
- Explain Ant colony system 2, optimization algorithm to solve TSP problem
Dar2003master
- Ant colony system 4, optimization algorithm to solve TSP problem
ACOAlgoithmsWithGuaranteedConvergenceToTheOptimal
- Ant colony system 15, optimization algorithm to solve TSP problem
TSPNearestNeighbour
- solving TSP using NearestNeighbour
java_ga
- 利用java实现遗传算法,用来解决tsp旅行商问题。功能已测试-Using Java implementation, genetic algorithm is used to solve TSP traveling salesman problem. Function has been tested
weka
- tspData <- read.csv( D:\\weka\\hw\\TSP.csv , header = T, sep = , ) #tspData <- `colnames<-`(tspData,c(1:8)) D <- as.matrix(tspData) tourLength <- function(tour, distMatrix) { tour <- c(tour, tour[1]) route <- embed(tou
TSP.ZIP
- TSP_Creating_E_V23.pdf Target packet creation for CoDeSys Licensing_MakeTarget.pdf Hw to make license and optional on deutsch
pso-in-java
- PSo solving TSP problem