- Category:
- matlab
- Tags:
-
- File Size:
- 2kb
- Update:
- 2018-04-16
- Downloads:
- 0 Times
- Uploaded by:
- henrylalala
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| vrp.m | 5824 | 2017-05-14 |
Download