搜索资源列表
vrp-in-GA
- 使用matlab编写遗传算法,解决车辆路径最优化问题。-VRp using GA methods
vrp
- 此代码是用lingo实现基本的vrp问题,简单易懂,方便学习-This code is used to achieve the basic lingo vrp problem, easy to understand, easy to learn
GA-VRP
- 使用MATLAB解决了VRP问题 代码简单易懂-Use MATLAB to solve the VRP straightforward code
genetic-algorithm-VRP
- 遗传算法求解VRP问题,自带绘制路径功能,且包含word对问题详细描述。-Genetic Algorithm for VRP problem, comes to draw a path function, and contains a detailed descr iption of the problem word.
VRP
- 两阶段法求解带时间窗的VRP问题,里面嵌套节约算法。-Two-stage method for solving the VRP with time windows, which nested saving algorithm.
vrp
- 用简单的遗传算法解决基本的车辆调度问题,新手很容易上手。-vrp ga
VRP
- 利用遗传算法 解决带时间窗口的车辆路径优化问题(VRP)-Genetic algorithm to solve vehicle window with Time Routing Problem (VRP)
VRP
- 使用蚁群算法求解VRP程序的一个较好的程序,Matlab源代码,包含过程文件-Using ant colony algorithm to solve VRP program of one of the better, the Matlab source code, containing process files
Metaheuristics-for-the-vrp
- Metaheuristics for the VRP with pick-up and deliver. This problem was solved using 5 metaheuristics which are detailed in the WinRAR file.
MATLAB-VRP
- MATLAB-遗传算法-多车场-开放式-带时间窗-多商品-VRP问题-MATLAB- genetic algorithm- MultiDepot- open- with time windows- multi-commodity-VRP problem
matlab-code-vrp
- matlab code vrp using sa
遗传算法
- 采用matlab语言编写,解决线路规划问题即VRP(solving VRP in matlab)
理论知识与选题介绍
- VRP问题的目标函数通常有三类: 总配送距离最短 总配送时间最短 总配送费用最少(The objective functions of the VRP problem are usually of three kinds: The total distribution distance is the shortest The total delivery time is the shortest The total distribution cost is at least)
遗传算法求解VRP问题的技术报告
- 本文通过遗传算法解决基本的无时限车辆调度问题。采用车辆和客户对应排列编码的遗传算法,通过种群初始化,选择,交叉,变异等操作最终得到车辆配送的最短路径。通过MATLAB仿真结果可知,通过遗传算法配送的路径为61.5000km,比随机配送路径67km缩短了5.5km。此结果表明遗传算法可以有效的求解VRP问题。(In this paper, genetic algorithm is used to solve the basic vehicle scheduling problem without
粒子群算法解决VRP代码(matlab)
- VRP/TSP模型,可以参考最小路径相关问题分析(VRP/TSP model, you can refer to the minimum path related problems analysis)
matlab_vrp(1)
- 首先实现一个ant蚂蚁类,用此蚂蚁类实现搜索。 算法按照tsp问题去解决,但是在最后计算路径的时候有区别。 比如有10个城市,城市1是配送站,蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。 计算路径的时候把城市依次放入派送线路中, 每放入一个城市前,检查该城市放入后是否会超过车辆最大载重 如果没有超过就放入 如果超过,就重新开始一条派送路线 …… 直到最后一个城市放完 就会得到多条派送路线 这样处理比较简单可以把vrp问题转为tsp问题求解 但
蚁群算法
- 蚁群算法解决VRP问题的MATLAB代码(Ant Metaheuristic for VRP)
2l_cvrp
- a vrp data used for research
CVRPSEP
- solutions of usual vrp
蚁群算法Matlab程序
- 求解VRP问题,实用的蚁群算法matlab程序(To solve the VRP problem, a practical ant colony algorithm matlab program)