搜索资源列表
Atabusearchalgorithmforthevehicleroutingproblem.ra
- 禁忌搜索算法解决VRP问题的论文,内有对车辆路径问题的简单综述,且对城市聚集情况有针对性的解决
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
VRP
- 利用模拟退火算法来求解双车库的车辆路径问题-Simulated annealing algorithm to solve the vehicle routing problem with double garage
Tabu-search-for-VRP
- 利用C++编程语言，用禁忌搜索解车辆路径问题-Tabu search for VRP
VRP
- 该程序是用C＋＋编写的蚁群算法程序，专门用来求解车辆路径问题（VRP）。-The program is in C++ ant colony algorithm written procedures, designed to solve the vehicle routing problem (VRP).
VRP
- 遗传算法解决简单的无时限有约束VRP车辆路径问题-Genetic algorithm to solve a simple non-time constrained VRP Vehicle Routing Problem
VRP
- 蚁群算法，2-opt，解决车辆路径问题（vrp）的matlab代码，修正了原始代码忽略初始节点下一节点cost的问题，但是对某些测试数据集存在车辆数大于或小于的标准问题。-Ant colony algorithm ,2-opt, vehicle routing problem (vrp) matlab code, amended the original code ignores the initial node next node cost problems, but for some tes
VRP_GA
- 在VC6.0中实现的使用遗传算法（GA）实现有时间窗约束的车辆路径问题（VRP）。-In VC6.0 achieved using genetic algorithm (GA) to achieve a time window constraint vehicle routing problem (VRP).
geneticVRP
- matlab编程遗传算法代码，解决VRP车辆路径问题-Genetic algorithm matlab programming code to solve VRP Vehicle Routing Problem
ant_CSharp
- 车辆路径问题的蚁群算法程序代码,考虑车辆的载重限制-ant syatem,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
vrp
- 使用matlab编写遗传算法，解决车辆路径最优化问题-Using MATLAB to prepare the genetic algorithm to solve the vehicle routing optimization problem
ACATSP
- 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case
验证性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)
ypap108-vehicle-routing-problem
- 车辆路径规划问题使用SA 方法，可以解决关于投递员路径问题还有相关其他问题，没有考虑time window。(Vehicle routing problem using SA simulation. Code and certain explanation.)
VRP算法
- 压缩包里放的是解决车辆路径问题的各种算法，提供给大家参考学习。