说明：  首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。 算法按照tsp问题去解决，但是在最后计算路径的时候有区别。 比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。 计算路径的时候把城市依次放入派送线路中, 每放入一个城市前，检查该城市放入后是否会超过车辆最大载重 如果没有超过就放入 如果超过，就重新开始一条派送路线 …… 直到最后一个城市放完 就会得到多条派送路线 这样处理比较简单可以把vrp问题转为tsp问题求解 但是实际效果还需要验证。
(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.)