搜索资源列表
WSPOOKA.ZIP
- Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
dataset_611081
- 该数据为TSP测试库数据，可用做TSP算法的测试，目前大多tsp测试都选用这个库里的数据为实例，它来自标准的TSPLIB95库。-TSP is a dataset directory which contains some examples of data for the traveleing salesperson problem. Most of these examples come TSPLIB, a collection of traveling salesman problem
05-ACO-for-TSP
- this code is ACO for TCP. work with this GA very simple.
acotsp-master
- Ant Colony Optimization for TSP using MPI
GA
- 遗传算法，解决TSP旅行商问题，利用swing实现图形化显示。-solving the traveling salseman problem，showing the result with graphics
gaijinyiqunsuanfa
- 使用蚁群算法matlab代码，并在其基础上进行改进，进而得以优化蚁群算法。解决全国所有城市的TSP问题-ACA TSP
HM-TSP
- Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
Traveling-Salesman-Problem---Nearest-Neighbor
- Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algor
10.1109@TSP.2009.2031732
- cognitive radio beamforming
ACO算法
- 蚁群优化算法，可用于解决一人旅行商等问题。(Ant colony optimization algorithm can be used for TSP and other issues)
TSP-ACR122U-3.05
- Application Programming Interface
蚁群算法的优化计算——旅行商问题(TSP)优化
- Ant Colony Optimization
遗传算法求解MTSP问题
- 利用遗传算法求解MTSP问题，起点终点为同一点，对于传统的TSP问题计算速度很快。
无源感知中频率与DOA的联合估计
- 利用时空欠采样技术，在互质阵列中多个sensor上放置两路ADC采样，结合中国余数定理与频谱校正技术，实现频率与波达方向的联合估计。发表在IEEE TSP上2区，很新，很有创新性。
路径规划
- 大坝无人碾压机路径规划（全覆盖路径规划CCP） 子区域的连通路径规划隶属于旅行商问题（TSP）即求解遍历各城市节点的最短路径 采用混沌理论改进的蜻蜓算法 首先进行运动学建模 其次基于时间成本对机群进行任务分配 优化问题为最小化时间成本 最后进行仿真分析
数学建模：matlab蚁群算法解决TSP问题.pdf
- MATLAB蚁群算法的实现，解决最短路程问题，报告内全部是实现，并且实现的代码。