搜索资源列表
VRPBase--No-smallrouteindex
- 禁忌搜索解决待时间窗车辆路径问题，c++基于visio studio 2010平台-Tabu Search Algorithm of VRP
ant_vrp
- 蚁群算法解决中规模车辆路径问题，vrp国际案例验证，可以运行，有图-Ant colony algorithm to solve the scale of vehicle routing problem, VRP international case verification, you can run, there are plans
vehicle-routing-problem
- 采用模拟退火方法解决有容量限制的车辆路径问题，matlab代码。Capacitated Vehicle Routing Problem (VRP) using SA. MATLAB -implementation of solving Capacitated Vehicle Routing Problem (VPR) using Simulated Annealing (SA)
XX_VRPTW
- 用智能算法中的遗传算法求解带时间窗限制的车辆路径问题-using GA algorithm to explain the problem of vrp with time windows
GAvrp
- 遗传算法在VRP下的应用代码，充分展示遗传算法的强大功能，能够解决VRP的最优化问题。-Genetic algorithm under the VRP application code, fully demonstrate the powerful function of genetic algorithm, can solve the optimization problem of VRP.
VRP_algorithm
- 5个求解车辆路径问题（VRP）的MATLAB算法源程序和相应数据（数据也在m文件里），包括三种遗传算法，SA算法和禁忌搜索算法的m文件-5 solving vehicle routing problem (VRP) MATLAB algorithm source and the corresponding data (data is also in the m file), including three kinds of geneti
YOUHUA
- 多目标路径优化问题，模拟退化算法。可以用车辆路径优化-Multi-destination path optimization, simulation degradation algorithm. You can use the VRP
ACATSP
- 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman P
Untitled2
- 用遗传算法解决带有时间约束软时间窗口的VRP（旅行商）旅行商问题(Solving the VRP (traveling salesman) traveling salesman problem with time constrained soft time windows by genetic algorith)
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 e