搜索资源列表
-
0下载:
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
-
-
0下载:
遗传算法编程求解旅行商问题;图论中最短路问题的Matlab程序实现;背包问题模型的Matlab程序实现。,Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process.
-
-
0下载:
:针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改
进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径
规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果
表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。-: Genetic algorithm for the lack of easy to
-
-
0下载:
在vc控制台中运行,用遗传算法求解最短路径,用邻接矩阵表示路线图。-Vc console in the run, the shortest path with the genetic algorithm, said the road map with the adjacency matrix.
-
-
0下载:
利用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
-
-
0下载:
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
-
-
0下载:
遗传算法计算最短圈MATLAB算法,矩阵C是邻接矩阵,NC是迭代次数。-Genetic algorithm for computing the shortest path
-
-
0下载:
利用matlab语言编写多个城市间,求最短路径的遗传算法源代码-Genetic algorithm source code, find the shortest path between the Matlab language multiple cities。
-
-
0下载:
遗传算法求解旅行商问题:求解12个城市最短旅游路径-Genetic algorithm to solve traveling salesman problem:Solving 12 cities the shortest travel path
-
-
0下载:
遗传算法解决最短路径问题matlab实现-Genetic algorithm to solve the shortest path problem matlab achieve
-
-
1下载:
遗传算法解决最短路径。在matlab中实现计算和结果输出。-The genetic algorithm to solve the shortest path. Calculated and results output in matlab.
-
-
0下载:
旅行商问题:全国省会二维坐标如图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
-
-
1下载:
基于遗传算法的解决两点之间最短路径问题(有向权值图最短路径问题)-Based on the shortest path between a genetic algorithm to solve the problem of two (shortest path problem to the weight chart)
-
-
1下载:
基于遗传算法的路径最优方法,来寻找最短的路径,使用matlab编写,注释详细-Optimal path method based on genetic algorithm, to find the shortest path, using matlab, annotation in detail
-
-
0下载:
用遗传算法解决最短路径优化TSP问题(附matlab源程序.txt)-The solvelution of the shortest path optimization problem TSP by using genetic algorithms
-
-
0下载:
已知个城市的坐标,采用遗传算法求解旅行商问题,得到最短路径-Known a city coordinates, the use of genetic algorithm to solve the traveler problem, get the shortest path
-
-
1下载:
tsp问题(全称:TravellingSalesmanProblem),又称为旅行商问题、货郎担问题、TSP问题,是一个多局部最优的最优化问题,遗传算法是一种基于种群演变一种优化的算法,在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is
-
-
0下载:
这是一个没有利用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)
-
-
1下载:
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
-
-
1下载:
假设在一个供求关系系统中,车辆从货源取货,配送到对应的若干配送点。车辆存在最大载货量,且配送可能有时间限制。需要合理安排取货时间,组织适当的行车路线,使用户需求得到满足,同时使某个代价函数最小,比如总工作时间最少、路径最短等。
可以看出TSP问题是VRP问题的一种简单特殊形式。因此,VRP也是一种NP hard 问题。
目前解决此种问题的办法有多种,主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等,本文介绍两种比较简单算法:C-W节约算法和遗传算法。(Assume that
-