Location:
Search - ANT VRP MATLAB
Search list
Description: 蚁群算法的应用描述，借鉴以为师兄的博士毕业论文-Application of ant colony algorithm description, from a doctoral thesis that师兄
Platform: |
Size: 180224 |
Author: wu |
Hits:
Description: 蚁群算法的matlab源码,该程序试图对具有31个城市的VRP进行求解，已知的最优解为784.1-Ant colony algorithm matlab source code, the program attempts to have 31 cities to solve VRP, known optimal solution for the 784.1
Platform: |
Size: 6144 |
Author: 王艳艳 |
Hits:
Description: 蚁群算法源程序.该程序试图对具有31个城市的VRP进行求解，已知的最优解为784.1-Ant colony algorithm source code
Platform: |
Size: 7168 |
Author: bocai |
Hits:
Description: 实用的蚁群算法，程序试图对具有31个城市的VRP进行求解，简单实用-Ant colony algorithm practical, the program attempts to have 31 cities to solve the VRP, simple and practical
Platform: |
Size: 6144 |
Author: 刘柳 |
Hits:
Description: 解决vrp问题用蚁群算法，其中有出错误，还没找出来。-ant colony vrp
Platform: |
Size: 2048 |
Author: 王相互 |
Hits:
Description: 强大的蚁群算法matlab程序源代码，可以迅速求解vrp等np难问题。-Ant colony algorithm matlab powerful source code, you can quickly solve the difficult problem of np such vrp.
Platform: |
Size: 15360 |
Author: 储育青 |
Hits:
Description: 蚁群算法解VRP问题 蚁群算法解VRP问题 蚁群算法解VRP问题 -the procedure of ant colony algorithm for VRP，used to solve the famous HP-hard problem: the VRP problem with the ant colony algorithm developed with matlab. It s not a felwell procedure, there are still some problems contained within this procidure.the procedure of ant colony algorithm for VRP，used to solve the famous HP-hard problem: the VRP problem with the ant colony algorithm developed with matlab. It s not a felwell procedure, there are still some problems contained within this procidure.the procedure of ant colony algorithm for VRP，used to solve the famous HP-hard problem: the VRP problem with the ant colony algorithm developed with matlab. It s not a felwell procedure, there are still some problems contained within this procidure.the procedure of ant colony algorithm for VRP，used to solve the famous HP-hard problem: the VRP problem with the ant colony algorithm developed with matlab. It s not a felwell procedure, there are still some problems contained within this procidure.the
Platform: |
Size: 2048 |
Author: Timson |
Hits:
Description: VRP问题的蚁群算法源码，很经典，很实用-Ant colony algorithm VRP source problem, it is a classic, it is practical
Platform: |
Size: 6144 |
Author: 任树伟 |
Hits:
Description: VRP问题蚁群算法的c++源码，很具有代表性-VRP problem of the ant colony algorithm c++ source code, it is a representative
Platform: |
Size: 11264 |
Author: 任树伟 |
Hits:
Description: 求解VRP问题的新解法蚁群算法matlab程序-The new method for solving VRP problems ant colony algorithm matlab program
Platform: |
Size: 2048 |
Author: naiyu |
Hits:
Description: 31个城市的VRP进行蚁群算法求解的matlab源码-31 cities, ant colony algorithm for VRP to the matlab source code
Platform: |
Size: 2048 |
Author: 叶宏 |
Hits:
Description: 该程序试图对具有31个城市的VRP进行求解，已知的最优解为784.1，我用该程序只能优化到810左右，应该是陷入局部最优，但我不知问题出在什么地方。请用过蚁群算法的高手指教。
蚁群算法的matlab源码，同时请指出为何不能优化到已知的最好解-The program attempts to have 31 cities of the VRP is solved, the optimal solution is known as 784.1, I use the program can only be optimized to about 810, should fall into local optimum, but I do not know where the problem is. Please teach master ant colony algorithm used. Ant colony matlab source, also please explain why not optimize the best solution to a known
Platform: |
Size: 2048 |
Author: liyanan |
Hits:
Description: 蚁群算法，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 test data sets exist more or less than the number of vehicles of standard questions.
Platform: |
Size: 2048 |
Author: lijian |
Hits:
Description: 首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。
算法按照tsp问题去解决，但是在最后计算路径的时候有区别。
比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。
计算路径的时候把城市依次放入派送线路中,
每放入一个城市前，检查该城市放入后是否会超过车辆最大载重
如果没有超过就放入
如果超过，就重新开始一条派送路线
……
直到最后一个城市放完
就会得到多条派送路线
这样处理比较简单可以把vrp问题转为tsp问题求解
但是实际效果还需要验证。(First of all, a ant ant class is implemented, and the ant class is used to search.
The algorithm is solved according to the TSP problem, but there is a difference in the final calculation of the path.
For example, there are 10 cities, and 1 of cities are distribution stations. The path for ants to search is 1,3,5,9,4,10,2,6,8,7.
When calculating the path, place the city in the delivery route,
Before entering a city, check whether the city will exceed the maximum load of the vehicle after it is put in
If it's not over, put it in
If it's over, start a delivery route again
......
Until the last city is over
You'll get multiple delivery routes
This approach is relatively simple, you can change the VRP Problem to TSP problem solving
But the actual results need to be verified.)
Platform: |
Size: 40806400 |
Author: Ywain
|
Hits:
Description: 求解VRP问题，实用的蚁群算法matlab程序(To solve the VRP problem, a practical ant colony algorithm matlab program)
Platform: |
Size: 16384 |
Author: flyever98
|
Hits:
Description: 首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。
算法按照tsp问题去解决，但是在最后计算路径的时候有区别。
比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。
计算路径的时候把城市依次放入派送线路中,
每放入一个城市前，检查该城市放入后是否会超过车辆最大载重
如果没有超过就放入
如果超过，就重新开始一条派送路线
……
直到最后一个城市放完
就会得到多条派送路线
这样处理比较简单可以把vrp问题转为tsp问题求解
但是实际效果还需要验证。(First, we implement a ant ant class, and use this ant class to search.
The algorithm is solved according to the TSP problem, but there are differences when calculating the path at last.
For example, there are 10 cities, 1 of cities are distribution stations, and the path of ants search is 1,3,5,9,4,10,2,6,8,7.
When calculating the path, put the city into the delivery line in turn.
Before placing a city, check whether the city will exceed the maximum vehicle load after putting it into the city.
If it's not over, put it in
If it's over, start a new route.
......
Until the last city is finished
There will be multiple delivery routes
This process is relatively simple and can transform the VRP problem into TSP problem solving.
But the actual effect needs to be verified.)
Platform: |
Size: 2048 |
Author: henrylalala |
Hits:
Description: 假设在一个供求关系系统中，车辆从货源取货，配送到对应的若干配送点。车辆存在最大载货量，且配送可能有时间限制。需要合理安排取货时间，组织适当的行车路线，使用户需求得到满足，同时使某个代价函数最小，比如总工作时间最少、路径最短等。
可以看出TSP问题是VRP问题的一种简单特殊形式。因此，VRP也是一种NP hard 问题。
目前解决此种问题的办法有多种，主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等，本文介绍两种比较简单算法：C-W节约算法和遗传算法。(Assume that in a supply and demand relationship system, the vehicle picks up the goods from the source and delivers them to the corresponding distribution points. There is a maximum amount of cargo in the vehicle and there may be a time limit for delivery. It is necessary to arrange the picking time reasonably, organize the appropriate driving route, and satisfy the user's needs, and at the same time minimize a certain cost function, such as the minimum total working time and the shortest path.
It can be seen that the TSP problem is a simple and special form of the VRP problem. Therefore, VRP is also an NP hard problem.
At present, there are many ways to solve this kind of problem, mainly based on heuristic algorithms. Including annealing algorithm, genetic algorithm, ant colony algorithm, tabu algorithm, etc. This paper introduces two simple algorithms: C-W saving algorithm and genetic algorithm.)
Platform: |
Size: 4096 |
Author: HappyppaH |
Hits:
Description: matlab 蚂蚁算法 进行VRP 计算(Matlab Ant Algorithms for VRP Computing)
Platform: |
Size: 6144 |
Author: b坏鱼f |
Hits:
Description: 用蚁群算法解决VRP问题，包含基本蚁群算法（我记得不含时间窗约束）(Using ant colony algorithm to solve VRP problem, including basic ant colony algorithm)
Platform: |
Size: 9216 |
Author: Shielas |
Hits:
Description: 用于求解配送路径优化问题，即vrp问题，算法是蚁群算法，优化目标为路线最短(It is used to solve the distribution path optimization problem, that is vrpentire. The algorithm is ant colony algorithm, and the optimization goal is the shortest route)
Platform: |
Size: 2048 |
Author: 小时代8884 |
Hits: