搜索资源列表
33
- 有界面的遗传算法程序 最小路径的运输路线选择。总体而言很不错的-A genetic algorithm program interface minimum path choice of transport routes. Overall, very good
LogFac_Exp_1
- java编写的最短路径算法，先由启发式方法获得染色体的初始编码，然后由遗传算法求出最短路径，对解决物流领域的TSP是非常好的计算机实现-java prepared by the shortest path algorithm, by the heuristic method to obtain the initial encoding of chromosome, and then by the genetic algorithm to derive the shortest path to s
ga_bp
- 基于gaot工具箱优化BP以实现数据拟合。在nninit.m中修改数据存储的路径以及隐含层节点数的设置（S1），遗传算法与bp的参数修改在ga_bp.m中进行。-Toolbox gaot Optimize based on BP in order to achieve data fitting. At nninit.m modify the path of data storage as well as the hidden layer nodes of the set (S1), geneti
genetic
- 使用遗传算法求解旅行商问题，城市数目及城市之间的距离通过txt文件来读入，然后输出求解过程及最后收敛到的最有路径-The use of Genetic Algorithm for Traveling Salesman Problem, the number of cities and the distance between cities through the txt file to read, and then output the solution process and the fina
GATraveller
- 遗传算法解车辆路径问题,解压即可运行，不需要密码-Genetic Algorithm for Vehicle Routing Problem, decompression can be run without a password
matlabforVRP
- 解决车辆路径问题的MATLAB代码，经过测试可以使用。算法采用遗传算法，对于写人工智能领域的相关论文有很大的帮助-Solve the vehicle routing problem with the MATLAB code that can be used after testing. Algorithm using genetic algorithms, artificial intelligence for the written papers of great help
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
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
r01
- 遗传算法车辆应急调度， C语言版本 ，产生随机车辆行驶路径。 -Emergency vehicles, scheduling genetic algorithm, C language to generate random traffic paths.
Genetic_Algorithm_for_vehicle_routing_problem
- 遗传算法解决车辆路径问题，希望对大家有所帮助。-Genetic Algorithm for vehicle routing problem, we want to help.
MATLAB
- 基于遗传算法的机器人路径规划MATLAB源码-Based on genetic algorithms for robot path planning MATLAB source
c
- 解遗传算法的c语言代码，就是关于货物配送路径-Genetic algorithm solution c language code
TSP
- 利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, th
Baseleath
- 基于量子遗传算法的无线传感器网络路径优化Based on quantum genetic algorithm optimization of wireless sensor network path-Based on quantum genetic algorithm optimization of wireless sensor network path
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
yichuan
- 解决路径寻优问题的遗传算法，经过相对路径寻优的问题进行改进的算法，提高算法运行速度(Genetic algorithm for solving path optimization problem)
改进的禁忌搜索算法
- 改进的禁忌搜索算法，求解路径寻优问题，相对传统的遗传算法，能够更精确求得全局最优解(Compared with the traditional genetic algorithm, the improved tabu search algorithm can solve the problem of path optimization, and can obtain the global optimal solution more accurately)
基于遗传算法的matlab语言车辆路径问题
- 车辆路线问题（VRP）最早是由Dantzig和Ramser于1959年首次提出，它是指一定数量的客户，各自有不同数量的货物需求，配送中心向客户提供货物，由一个车队负责分送货物，组织适当的行车路线，目标是使得客户的需求得到满足，并能在一定的约束下，达到诸如路程最短、成本最小、耗费时间最少等目的。(The vehicle routing problem (VRP) was first proposed by Dantzig and Ramser in 1959, it refers to a cer