搜索资源列表
ylgorithmgenetic
- 遗传算法车辆延误优化,这个是别人的程序,大家看看吧~,-Vehicle delay optimization genetic algorithm, this is someone else s program, we look at it ~,
vook
- 遗传算法车辆延误优化,这个是别人的程序,大家看看吧~,-Vehicle delay optimization genetic algorithm, this is someone else s program, we look at it ~,
697577
- 遗传算法车辆延误优化,这个是别人的程序,大家看看吧~,-Vehicle delay optimization genetic algorithm, this is someone else s program, we look at it ~,
354659
- 遗传算法车辆延误优化,这个是别人的程序,大家看看吧~,-Vehicle delay optimization genetic algorithm, this is someone else s program, we look at it ~,
dxng
- 遗传算法车辆延误优化,这个是别人的程序,大家看看吧~,(Vehicle delay optimization genetic algorithm, this is someone else's program, we look at it ~,)
验证性VRP
- 利用遗传算法实现VRP问题,将车辆路径问题规划的较为详细,算法较为良好(The genetic algorithm is used to solve the VRP problem, and the vehicle routing problem is more detailed and the algorithm is better)
GA
- 遗传算法的车辆路径研究,实现的是配送路径最短(Genetic algorithm of vehicle routing research, the realization of the shortest delivery route)
代码
- 基与遗传算法的动态规划,可以解决对于有时间窗约束的多目标车辆寻路问题(HUBThe dynamic programming of base and genetic algorithm can solve the problem of multi-objective vehicle routing problem with time window constraints)
vrp
- 车辆路径问题用遗传算法来求解,借助了matlab的程序代码(The vehicle routing problem is solved by genetic algorithm, with matlab program code.)
li3
- 经典TSP问题,对于学习遗传算法以及车辆路径的同学及其有帮助,(The classic TSP problem is helpful to the learning of genetic algorithms and the students of the vehicle path.)
地震正在运行
- 采用matlab解决带时间窗的车辆路径规划问题,用了遗传算法(Using matlab to solve vehicle routing problem with time windows, using GA)
MDVRP
- 遗传算法求解多车场车辆路径问题 有多组算例可以用(Genetic algorithm for solving multi-depot vehicle vehicle routing problems)
VRP
- 利用遗传算法解决vrp问题,其中车辆承载能力固定,车场只有一个。(Genetic algorithm is used to solve VRP problem, in which the vehicle carrying capacity is fixed and there is only one garage.)
vrp
- 车辆路径问题 多种算法解决 遗传算法 改进的遗传算法(Various Algorithms for Vehicle Routing Problem Improvement of Genetic Algorithms)
vrp
- 假设在一个供求关系系统中,车辆从货源取货,配送到对应的若干配送点。车辆存在最大载货量,且配送可能有时间限制。需要合理安排取货时间,组织适当的行车路线,使用户需求得到满足,同时使某个代价函数最小,比如总工作时间最少、路径最短等。 可以看出TSP问题是VRP问题的一种简单特殊形式。因此,VRP也是一种NP hard 问题。 目前解决此种问题的办法有多种,主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等,本文介绍两种比较简单算法:C-W节约算法和遗传算法。(Assume that
MDVRP
- 借助遗传算法求解多中心车辆路径规划问题,算法程序在matlab上实现(Genetic algorithm for solving vehicle routing problem)
vrp
- 遗传算法求解vrptw,带时间窗约束的车辆路径问题(Genetic algorithm for VRPTW vehicle routing problem with time window constraints)