Upload Code
loading-left
loading loading loading
loading-right

Loading

Profile
No self-introduction
codes (1)
Ant colony algorithm for VRP
no vote
Ant colony algorithm to solve the VRP Problem, first of all to achieve an ant ant class, using this ant class to achieve search. The algorithm solves the TSP problem, but there are differences in the final path calculation. For example, there are 10 cities, city 1 is the distribution station, and the path obtained by ant search is 1,3,5,9,4,10,2,6,8,7. When calculating the route, put the cities into the distribution line in turn. Before each city is put into the distribution line, check whether the city will exceed the maximum load of the vehicle after it is put into the distribution line. If it does not exceed the maximum load, put it into the distribution line. If it exceeds the maximum load, start a new distribution line Until the last city is released, there will be multiple delivery routes
Grace2018
2018-01-16
1
1
No more~