搜索资源列表
用遗传算法计算最短路径
- ｍａｔｌａｂ编写的计算排序问题或者求最优值问题，适用于数学建模以及工程计算-Matlab calculations prepared by the scheduling problem or seek optimal values, apply to mathematical modeling, and engineering computing
beyeshi
- 贝叶斯决策解决城市最短路径问题,人工只能实验项目-Bayesian decision-making to address the urban shortest path, artificial only pilot projects
Double_ACO_TSP
- 此程序包是用双种群蚁群算法来求中国75个城市的最短路径问题，即典型的TSP问题，把包解压运行main.m文件即可
ych1
- 用遗传算法求解最短路径问题-Genetic Algorithm for the shortest path problem
dbcstp.m
- 此程序用遗传算法实现几个地方的历经最短路径问题。
yichuansuanfajichu2
- 关于遗传算法的理论以及应用，包括车间调度，函数优化，求最短路径问题等
yichuansuanfajichu3
- 关于遗传算法的理论以及应用，包括车间调度，函数优化，求最短路径问题等
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and 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
short_ruote
- 这是一个用迪杰斯特拉算法求最短路径问题的算法-This is a used Dijkstra algorithm for shortest path algorithm
simulaiton_annealing
- 著名的模拟退火算法源程序,运用的例子是TSP问题,以中国31省会城市的最短旅行路径为例.-Well-known source of the simulated annealing algorithm, using the example is the TSP in order to China s 31 provincial capital cities as an example of the shortest path to travel.
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
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
ACS2
- 改进的蚁群算法，用于求解基于交通密度的最短路径规划问题。-Improved ant colony algorithm for solving the shortest path based on traffic density planning.
ACATSP
- 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case