Vehicle Transportation Routing Selection System Based On Ant Colony Algorithm For Grass-roots Units

With the rapid development of China’s modernization and urbanization,the modern logistics industry is playing an increasingly important role.People are more and more strict about the distance,time,speed and cost of logistics services.Especially the timeliness and economy in the process of logistics service has been paid enough attention.At the same time,the problem of vehicle routing in military logistics has also attracted great attention in the field of military logistics support,and then a considerable number of high-quality talents and technical means have been introduced.However,the geographical location of grass-roots units is remote and there is little opportunity for training and learning.Coupled with the scarcity of professional talents and backward technical means,the choice of vehicle route can not meet the demand of ‘low consumption and high efficiency’ in work and life,which leads to the transportation time is too long and the cost is too high.Therefore,this paper studies the vehicle routing problem of grass-roots units.In order to design a vehicle route selection system close to the actual situation of grass-roots units,First of all,On the basis of summarizing the current research situation and theory of vehicle routing problem and ant colony algorithm,this paper uses the related theories of modern logistics,military logistics and emergency logistics.By summarizing the existing research on vehicle routing in military logistics,this paper systematically analyzes the vehicle routing problems that often occur and frequently used in the operation of grass-roots units,which can be summarized into two types of four situations,it can be divided into non full load and full load situations in peacetime,and general emergency and super emergency situations in non wartime emergency.Then,four kinds of models are built to solve the vehicle routing problem,In this process,two methods are adopted,changing ‘one-step transfer’ to ‘looking at the whole’and changing ‘fixed value’ to ‘dynamic adjustment’,In view of the shortage of ant colony algorithm,combined with the experimental analysis,according to the "three-step" method,the optimal parameter combination applied to the vehicle routing problem of grass-roots troops is proposed.In addition,when solving two kinds of path problems in non wartime emergency state,clustering idea is introduced before path planning,The improved k-means clustering algorithm based on ant colony pheromone is used to cluster and segment the task unit coordinates and select the temporary distribution center.Finally,the MATLAB software is used to simulate and verify the example data,and the output results are optimized to a certain extent,which proves that the improved algorithm in this paper is feasible and effective.And based on the GUI program,which is a graphic interface platform provided by MATLAB,a vehicle route selectionsystem close to the actual situation of grass-roots units is designed.Among them,proposes to combine the European distance and Manhattan distance to improve the calculation distance formula,making it more suitable for the actual application.