- Category:
- matlab
- Tags:
-
[PDF]
- File Size:
- 38.92mb
- Update:
- 2017-08-29
- Downloads:
- 0 Times
- Uploaded by:
- Ywain
Description: 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.
To Search:
File list (Check if you may need any files):
matlab_vrp(1).rar
=== 带精英策略的排序蚁群算法(C语言) ===.eml
====== 轮盘选择说明 ======.eml
最大最小蚁群算法.rar
=== 蚁群算法 机器人路径规划===.eml
机器人路径规划(1).rar
蚁群算法原理及其应用.pdf
antfunc6.rar
蚁群算法原理及其应用(1).pdf
=== 蚁群算法英文文献 ===.eml
Download