文件名称:vrp
介绍说明--下载内容来自于网络,使用问题请自行百度
假设在一个供求关系系统中,车辆从货源取货,配送到对应的若干配送点。车辆存在最大载货量,且配送可能有时间限制。需要合理安排取货时间,组织适当的行车路线,使用户需求得到满足,同时使某个代价函数最小,比如总工作时间最少、路径最短等。
可以看出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.)
可以看出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.)
相关搜索: matlab vrp
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
vrp | 0 | 2019-04-04 |
vrp\VRP.m | 739 | 2008-08-19 |
vrp\exchange.m | 52 | 2008-08-05 |
vrp\geneticVRP.m | 4621 | 2008-08-19 |
vrp\immuni.m | 165 | 2008-08-05 |
vrp\intercross.m | 1912 | 2008-08-05 |
vrp\mutate.m | 113 | 2008-08-05 |
vrp\myLength.asv | 1013 | 2008-08-19 |
vrp\myLength.m | 1013 | 2008-08-19 |
vrp\readme.txt | 200 | 2008-08-19 |
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.