- Category:
- matlab
- Tags:
-
- File Size:
- 4kb
- Update:
- 2019-04-04
- Downloads:
- 0 Times
- Uploaded by:
- HappyppaH
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 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 |
Download