搜索资源列表
TSP
- 回溯算法解决TSP路径问题,找出最优路径以及堵车后的最优路径-Optimal path after backtracking algorithm to solve TSP path problem, find the optimal path, and traffic jams
PSO
- 蚁群算法 用java语言编写的配送物品最优路径-Ant colony algorithm using java language Distribution optimal path items
Ant-Colony-Optimization-(ACO)
- 基于蚁群算法的路径最优化分析程序，可求解几个城市之间的最优路径问题。-Path based on ant colony optimization analysis program can be solved in several cities between the optimal path problem.
pso-for-shenjingwangluo
- 神经网络蚁群算法，主要可用于搜索最优路径 即求某一个函数的最值问题-Neural Networks ant colony algorithm, can mainly be used to search for the optimal path that is seeking a particular function' s value problems
gps
- 简单的导航系统，计算两地最优路径。平且可以增加和删除路径，同时可以获取系统时间-Simple navigation systems to calculate the optimal path between the two places. Flat and can add and delete the path, and can get the system time
undirectedgraph
- 建立了无向图结构完成了图的遍历与最短距离与最优路径的寻找-Established a complete undirected graph structure graph traversal with the shortest distance and find the optimal path
TSP-CPP
- 典型的人工智能问题-旅行商问题的最优路径问题的解决方案-A typical problem of artificial intelligence- the traveling salesman problem of the optimal path solution to the problem
BPSK-viterbi
- 基于维特比译码算法的BPSK解调方式，survivor_state是一个矩阵，它显示了通过网格的最优路径，这个矩阵通过一个单独的函数metric(x,y)给出，这个算法既能用于硬判决译码也能用于软判决译码。 -BPSK demodulation method based on viterbi decoding algorithm, survivor_state is a matrix, the optimal path of it shows through the grid, the me
ants
- 蚁群算法在物流配送中运用，实现最优路径巡寻优，可得出实际界面，直观-Ant colony algorithm applied in logistics and distribution, to achieve optimal path patrol optimization can be drawn from the actual interface, intuitive
lujing
- 蚁群算法 TSP商旅问题 最优路径 最短路问题-Ant colony algorithm TSP business problems The optimal path The shortest path problem The application of graph theory
path
- 这是计算最优路径的Floyd算法在Matlab中的实现程序。-This is the calculation of the optimal path Floyd algorithm in Matlab implementation process.
MainAneal
- 模拟退火算法对tsp问题的求解，求解的是最优路径-Simulated annealing algorithm for tsp problem solving, solving the optimal path
algo3-5
- 求解有关迷宫路径的问题的算法，可以输出最优路径，以及所有路径-path of a puzzle...
xunjin
- 运用弗洛伊德算法c++解决寻找最优路径方案-C++ using Floyd algorithm to find the optimal solution path program
EightCode
- 八数码A*算法，且输出最优路径，MFC界面实现-Eight digital A* algorithm, and outputs the optimal path, MFC interface implementation
N_Number
- N数码难题，能自动寻找最优路径解决多数码难题，人工智能的c#实现版本-N digital problem that can automatically find the optimal path to solve the problem of multi-digital, artificial intelligence c# implementation version
three-dimensional-path-planning
- 基于蚁群算法的三维路径规划。在三维地图上寻找最优路径！-Ant colony algorithm based three-dimensional path planning. To find the optimal path on the three-dimensional map!
GACOTSP
- 广义蚁群算法在TSP问题中的实现，得出蚂蚁寻找到的最优路径和收敛过程。-Generalized ant colony algorithm in TSP problems, draw ants to find the optimal path and the convergence process.
yiqunsuanfa
- 蚁群算法是目前应用最广的智能算法之一，该程序应用蚁群算法求解最优路径-Ant colony algorithm is one of the most widely used intelligent algorithm, the program ant colony algorithm for optimal path
Dijsktra_final
- 基于Dijkstra方法的最短路径改良版方法,能够一次性搜索出最优最优起点终点、最优路径、路径长度，常用于图论相关问题-Shortest path method ,which is based on a modified version of the method Dijkstra, is possible to search out the best starting point, terminate point, the optimal path, and the path length.I