搜索资源列表
用遗传算法计算最短路径
- ｍａｔｌａｂ编写的计算排序问题或者求最优值问题，适用于数学建模以及工程计算-Matlab calculations prepared by the scheduling problem or seek optimal values, apply to mathematical modeling, and engineering computing
20050218233130760
- 有关遗传算法的例子，可以解决诸如数学中函数近似最大值，最短路径的问题-example, can be resolved, such as mathematics approximate maximum function, the shortest path problem
ayangmovie
- 有关遗传算法的例子，可以解决诸如数学中函数近似最大值，最短路径的问题.vb开发的,很好的 .-example, can be resolved, such as mathematics function approximate maximum shortest path problem. Vb development, very good.
ych1
- 用遗传算法求解最短路径问题-Genetic Algorithm for the shortest path problem
Genetic最短路径
- 在vc控制台中运行，用遗传算法求解最短路径，用邻接矩阵表示路线图。-in vc console operations, Genetic Algorithm for the shortest path, adjacency matrices road map.
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
Real-World_Application_Routing_Problem(Book)
- 遗传算法在最短路径问题（shortest path routing problem）中的实际应用-Real-World Application：Routing Problem(Book)
jsjy20070288
- :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。-: Genetic algorithm for the lack of easy to
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
tsp
- 用遗传算法解决最短路径优化TSP 问题（附matlab源程序.txt）-The solvelution of the shortest path optimization problem TSP by using genetic algorithms (matlab source. Txt)
GATSP
- 遗传算法计算最短路径，从A城市出发到Z城市，一共76个城市参与计算-Genetic algorithm to calculate the shortest path from A to Z City departure city, a total of 76 cities involved in the calculation
GA_TSP
- 使用遗传算法求解最短路径问题。用VC++实现，代码带注释，清晰易懂-GA for the Tsp
path-planning2
- 用matlab程序编写的遗传算法路径规划程序用来实现最短路径问题。-Programming using genetic algorithm matlab path planning process used to achieve the shortest path problem.
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
遗传算法求解VRP问题的技术报告
- 本文通过遗传算法解决基本的无时限车辆调度问题。采用车辆和客户对应排列编码的遗传算法，通过种群初始化，选择，交叉，变异等操作最终得到车辆配送的最短路径。通过MATLAB仿真结果可知，通过遗传算法配送的路径为61.5000km,比随机配送路径67km缩短了5.5km。此结果表明遗传算法可以有效的求解VRP问题。(In this paper, genetic algorithm is used to solve the basic vehicle scheduling problem without
BPwangluo
- 这是一个没有利用MATLAB工具箱编写的遗传算法 用来求解TSP问题寻求最短路径(This is a genetic algorithm that is not written using the MATLAB toolbox Used to solve the TSP problem to find the shortest path)
用遗传算法计算最短路径
- 无人机避障，遗传算法，最短路径，求解TSP问题，仿真程序(Unmanned air vehicle obstacle avoidance)
算法
- floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，模拟退火算法是局部最优解能概率性地跳出并最终趋于全局最优，遗传算法是一种通过模拟自然进化过程搜索最优解的方法。(The Floyd algorithm is also known as the insertion point method, which is a multi weighted graph using the idea of dynamic programming for the giv
遗传算法解决TSP问题
- 通过遗传算法解决旅行商遍历各城市得到最短路径的问题