搜索资源列表
模拟退火法计算最短路径
- 用模拟退火法高效的计算图论中哈密顿贿赂的最短路径-simulated annealing method of calculating efficient graph theory Hamiltonian bribery Shortest Path
Dijkstra算法的最短路径查询
- 最短路径算法的VB实现，最短路径的查询程序-shortest path algorithm VB, shortest path inquiry procedures
Genetic最短路径
- 在vc控制台中运行，用遗传算法求解最短路径，用邻接矩阵表示路线图。-in vc console operations, Genetic Algorithm for the shortest path, adjacency matrices road map.
AStar.用A形算法寻找迷宫的最短路径,VC实现
- 用A形算法寻找迷宫的最短路径,VC实现,非常值得一看,A fractal algorithm used to find the shortest path maze, VC achieve, very worth a visit
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
ycsf_zdlj.rar
- 基于遗传算法的最短路径计算 程序简洁 速度很快 界面不是很完善,Based on genetic algorithms calculate the shortest path
GeneticAlgorithm
- 一个遗传算法求解两点最短路径问题的具体实现，采用C++编写，经测试当求解路径较复杂时，其算法执行效率高于dijstra算法-A genetic algorithm for two concrete realization of the shortest path problem, using C++ written in the path have been tested when solving more complex, its algorithm is more efficient tha
AstarPathFind
- 使用AStar算法实现的寻找最短路径的演示程序，使用C++编写的MFC程序，有非常好看的界面。-Use AStar the shortest path algorithm to look for the demonstration program, using C++ program written in MFC, there is a very nice interface.
short_ruote
- 这是一个用迪杰斯特拉算法求最短路径问题的算法-This is a used Dijkstra algorithm for shortest path algorithm
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
yiqun
- 蚁群算法，基于蚁群算法的最短路径问题，编译环境为c-Ant algorithm, ant colony algorithm based on the shortest path problem, the compiler environment for c++
Real-World_Application_Routing_Problem(Book)
- 遗传算法在最短路径问题（shortest path routing problem）中的实际应用-Real-World Application：Routing Problem(Book)
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
tabu-matlabcode-tsp
- 蚁群法在最短路径中的运用，附带matlab代码-Ant in the use of the shortest path, with matlab code
path-planning2
- 用matlab程序编写的遗传算法路径规划程序用来实现最短路径问题。-Programming using genetic algorithm matlab path planning process used to achieve the shortest path problem.
TSPGOOD
- 基本蚁群算法的matlab实现，可以用于求解城市间的最短路径问题。-Matlab implementation of basic ant colony algorithm can be used to solve the shortest path between cities.
chengxu
- 本文中利用遗传算法求解的问题为最短路径，该问题可描述为：在某大学校园内有多个场所，各场所之间有一个相关的距离cij ，目标就是要寻找一条从指定的起点 s 到指定的终点 t 的一条路径，使总距离最小。-This paper the problem using genetic algorithm for the shortest path, the problem can be described as: a university campus in a number of places, the
ACS1
- 稍加修改的基本蚁群算法，可用于求解交通路径规划中的距离最短路径的求解。-Slightly modified the basic ant colony algorithm can be used to solve the traffic path planning to solve the shortest path distance.
ACS2
- 改进的蚁群算法，用于求解基于交通密度的最短路径规划问题。-Improved ant colony algorithm for solving the shortest path based on traffic density planning.