搜索资源列表
GA_TSP yiqun
- 蚁群算法解决vrp问题，主函数和各个子程序，全部，可运行。(The ant colony algorithm solves the VRP Problem, the main function and the various subroutines, all of which can be run)
VRP模拟退火
- 采用模拟退火算法求解车辆路径问题 (Using simulated annealing algorithm to solve the vehicle routing problem)
蚁群算法
- 蚁群算法的代码实现，主要是针对车辆路径优化VRP 问题的实现(The vehicle routing problem with ant colony optimization algorithm)
odnd_transparent
- 蚁群算法的matlab源码,该程序试图对具有31个城市的VRP进行求解,已知的最优解为784 1()
dynamic programing algorithm
- dynamic programing VRP
nearest neighbor (option 2)
- code for nearest neighbour
nearest neighbour algorithm
- vehicle routing problem
iterated-local-search
- vehicle routing lecture
code
- 一种群智能优化算法布谷鸟算法，用于车间调度，TSP问题以及VRP问题的优化等(A population intelligent optimization algorithm, the cuckoo algorithm, is used for job shop scheduling, TSP problem and optimization of VRP problems.)
stowxge
- 蚁群算法源程序 该程序试图对具有31个城市的VRP进行求解,已知的最优解为784 1()
vrp
- 车辆路径问题用遗传算法来求解，借助了matlab的程序代码(The vehicle routing problem is solved by genetic algorithm, with matlab program code.)
4365263
- vrp问题的解决,对8个点的计算解决比较好()
87276403ga
- 运用matlab求解基本的带容量的车辆路径问题(Matlab is applied to solve the basic vehicle routing problem with capacity.)
gengli(1)
- 用于求解带时间窗的车辆路径问题，本代码用于求解多目标问题(to solve the vehicle routing problem with time window,this code is used to solve multi-objective optimization problems)
CVRP
- 车辆路径问题CVRP的matlab编程，里面包含了A32数据的导入，以及距离矩阵和适应度函数，以及CVRP求解的主程序。(programming of vehicle routing problem CVRP)
python实现VRPTW求解禁忌搜索算法
- 采用禁忌搜索算法解决问题，解决带时间窗的VRP问题(Tabu search algorithm is used to solve the problem and solve the VRP problem with time windows.)
PSO算法求解CVRP“车辆路径问题”
- 有容量限制的车辆路径问题的启发式算法,本实验采用的是粒子群算法(heuristic algorithm for capacited vehicle routing problem)
Genetic algorithm to vehicle routing problem
- 这个代码是采用遗传算法解决车辆路径优化问题，大家一块学习(This code is to solve the vehicle routing optimization problem with genetic algorithm.)
VRP-模拟退火
- 可以运行，效果很好，就是我不明白，请大神解释一下(can run but very difficult to konw)
hga-for-vrpsd
- matlab求解vrpsd问题,解压可运行(HGA-for-VRPSD, The VRP is a well known integer programming problem which falls into the category of NP Hard problems, meaning that the computational effort required to solve this problem increases exponentially with the problem