搜索资源列表
20050218233130760
- 有关遗传算法的例子，可以解决诸如数学中函数近似最大值，最短路径的问题-example, can be resolved, such as mathematics approximate maximum function, the shortest path problem
jsjy20070288
- :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。-: Genetic algorithm for the lack of easy to
use_GA_for_TSP
- 该MATLAB程序用遗传算法GA处理最短巡航路径问题（TSP）-The algorithm uses GA to deal with the shortest load （TSP）
12452
- 在vc控制台中运行，用遗传算法求解最短路径，用邻接矩阵表示路线图。-Vc console in the run, the shortest path with the genetic algorithm, said the road map with the adjacency matrix.
5
- 利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动-Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the
Matlab_tsp
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 D是距离矩阵，n为种群个数 参数a是中国31个城市的坐标 C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定 m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大 alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值 R为最短路径,Rlength为路径长度- TSP problem (also known as: traveling
genetic-algorithm-in-matlab-language
- 利用matlab语言编写多个城市间，求最短路径的遗传算法源代码-Genetic algorithm source code, find the shortest path between the Matlab language multiple cities。
zuiduanlujiin
- 遗传算法解决最短路径问题matlab实现-Genetic algorithm to solve the shortest path problem matlab achieve
Short-road
- 遗传算法解决最短路径。在matlab中实现计算和结果输出。-The genetic algorithm to solve the shortest path. Calculated and results output in matlab.
Traveling-salesman
- 旅行商问题：全国省会二维坐标如图30所示，基于遗传算法设计从黑龙江到西藏，并遍历全国各省会(每个省会只经过一次）的最短路径-Traveling salesman problem: two-dimensional coordinates of the national capital as shown in Figure 30, based on genetic algorithm design from Heilongjiang to Tibet and traverse the provinc
Short-road
- 基于遗传算法的解决两点之间最短路径问题（有向权值图最短路径问题）-Based on the shortest path between a genetic algorithm to solve the problem of two (shortest path problem to the weight chart)
GA_BP
- 用遗传算法解决最短路径优化TSP问题(附matlab源程序.txt)-The solvelution of the shortest path optimization problem TSP by using genetic algorithms
genetic-algorithm-TSP
- 遗传算法求解随机生成城市的最短路径问题即旅行商问题，同时生成路径图-a solution to TSP problem based on genetic algorithm
gasaTSP
- 利用改进的并行遗传退火算法求解了tsp问题，得到性能收敛图和最短路径-Using improved parallel genetic annealing algorithm the tsp problem, get map and the shortest route convergence performance
Genetic-Algorithm-TSP
- 使用遗传算法解决旅行商问题，matlab程序，寻找最短路径，智能优化算法课程-the solution to TSP by Genetic Algorithm
chapter4
- 已知个城市的坐标，采用遗传算法求解旅行商问题，得到最短路径-Known a city coordinates, the use of genetic algorithm to solve the traveler problem, get the shortest path
遗传算法求解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