当前位置:
首页 资源下载
搜索资源 - shortest path genetic
搜索资源列表
-
0下载:
用遗传算法解决最短路径优化TSP问题(附matlab源程序.txt)-The solvelution of the shortest path optimization problem TSP by using genetic algorithms
-
-
0下载:
遗传免疫算法的最短路径求取,用matlab语言实现,可对机器人的路径进行规划。-The shortest path to strike a genetic immune algorithm, using matlab language, can robot path planning.
-
-
0下载:
蚁群算法 解决最短路径 用C++来实现其功能 基于遗传算法的最短路径问题-Ant colony algorithm to solve the shortest path with C++ to achieve its function based on the shortest path problem of genetic algorithm
-
-
0下载:
用遗传算法求解有向带权图必经结点约束的最短路径问题-Genetic algorithm for designated-points shortest path problem.
-
-
2下载:
遗传免疫算法的最短路径求取,用matlab语言实现,可对机器人的路径进行规划-The shortest path to strike a genetic immune algorithm, using matlab language, can robot path planning
-
-
1下载:
基于遗传算法的路径路径寻优算法,在一系列目标之中寻找最短路径-Genetic algorithm based on the path optimization algorithm, in a series of goals to find the shortest path
-
-
0下载:
已知个城市的坐标,采用遗传算法求解旅行商问题,得到最短路径-Known a city coordinates, the use of genetic algorithm to solve the traveler problem, get the shortest path
-
-
0下载:
基于遗传算法的TSP算法。本案例以14个城市为例,寻找出一条遍历14个城市的最短路径。-TSP Algorithm Based on Genetic Algorithm. In this case, 14 cities, for example, to find a traversal of the 14 cities in 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
-
-
1下载:
本文通过遗传算法解决基本的无时限车辆调度问题。采用车辆和客户对应排列编码的遗传算法,通过种群初始化,选择,交叉,变异等操作最终得到车辆配送的最短路径。通过MATLAB仿真结果可知,通过遗传算法配送的路径为61.5000km,比随机配送路径67km缩短了5.5km。此结果表明遗传算法可以有效的求解VRP问题。(In this paper, genetic algorithm is used to solve the basic vehicle scheduling problem without
-
-
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)
-
-
0下载:
利用遗传算法解决最短路径问题(商旅问题)(Using genetic algorithm to solve the shortest path problem (business travel problem))
-
-
0下载:
此程序为TSP问题的遗传算法,程序可以完美运行,计算最短路径。(This procedure for the TSP problem by genetic algorithm, the program can run perfectly, the shortest path calculation.)
-
-
0下载:
本算法采用了基于蚁群算法的遗传算法对车辆进行调度,车辆能够找到最优路径,实现最短时间调度,实验验证了算法良好。(The algorithm uses a genetic algorithm based on ant colony algorithm to schedule the vehicle the vehicle can find the optimal path to achieve the shortest time scheduling experiments show that t
-
-
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
-
-
3下载:
实现了遗传算法的gui。
可实现图形化指定障碍物位置,然后用遗传算法实现最短路径规划。(GUI of genetic algorithm.
It can specify the location of obstacles graphically, and then use genetic algorithm to realize the shortest path planning.)
-
-
1下载:
假设在一个供求关系系统中,车辆从货源取货,配送到对应的若干配送点。车辆存在最大载货量,且配送可能有时间限制。需要合理安排取货时间,组织适当的行车路线,使用户需求得到满足,同时使某个代价函数最小,比如总工作时间最少、路径最短等。
可以看出TSP问题是VRP问题的一种简单特殊形式。因此,VRP也是一种NP hard 问题。
目前解决此种问题的办法有多种,主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等,本文介绍两种比较简单算法:C-W节约算法和遗传算法。(Assume that
-