||The purpose of the Home-delivery is to planning a suitable transport routes to Satisfy demands of customers, make the delivery staff can deliver goods as the target in minimize transport costs and the shortest distance transport. Multiple traveling salesman problem, (MTSP) has lots of types, widely-discussed in Vehicle Routing Problem,(VRP).Most of VRP is the question belong NP-hard, if request to take the best solution, then the number of points will be presenting growth index as the calculation time increases. So obtaining the best solution when problems in large scale always quite time-consuming. In recent years, scholars made a number of heuristic algorithms and obtained some results. In this paper, single depot Vehicle Routing Problem and Multi-depots Vehicle Routing Problem will be discussed.
In this study, use ant colony algorithm combined minimum - maximum distance, the number of vehicles as the basis for grouping, setting the distance comparison after each ant taken the first steps, only choose the ants walked shortest distance, and remainder will have to return to the starting point. According to this way to find a shorter path, conducted the path construct. So each delivery staff can be reached by walking distance proximity, and the total distance is shorter.in the other side, through solving the case of the benchmark test examples and examples in the paper of Hongqiang Zheng to verify the mode and method of construct in this study, after test respectively, the method proposed by this study found that there is a good achievement for solving.