Research On Rural Garbage Collection Routing Based On Ant Colony Algorithm

In recent years,with the construction of new countryside,the rapid development of rural economy,and continuous improvement of villagers' living standard,many problems have produced.Among them,the more prominent is the increasing number of rural garbage.The problem of rural garbage does not get the community's attention and investment timely,and villagers' awareness of environmental protection is weak,which cause garbage problem to become an important factor that hindering rural sustainable development.From “rural garbage management” was written into the central document 1 at the beginning of 2015,the government and relevant departments have increased the intensity of governance of rural garbage.For example,ten departments represented by the Ministry of Housing and Construction put forward the rural garbage collection and processing mode,which is “village collection,town transport,county processing”,according to the actual situation of China's rural areas.This paper studies the second section,which is “town transport”.Based on the actual situation of rural garbage collection,this paper puts forward the mathematical model of rural garbage collection routing problem,and aims to get the shortest garbage collection route and save the cost of rural garbage governance.Swarm intelligence algorithm is biomimetic simulation evolutionary algorithm and modern heuristic algorithm,which abstracts from the law of cooperation among biodiversity in nature.It is robust,easy to parallel processing,simple operation and so on.Although the rules that individual follows are extremely simple,the intelligence shows at global level through the interaction between them.Swarm intelligence algorithm is usually used to solve routing problem.Ant colony algorithm is a typical representative of swarm intelligence algorithm.With positive feedback,it is easy to find the global optimal solution and shows a good performance in solving routing optimization problem.Therefore,this paper focuses on ant colony algorithm,and proposes a hybrid ant colony algorithm based on max-min ant system.In the new algorithm,three improvements are made.(1)Combining the idea of saving algorithm.According to the mathematical model,a new saving factor is introduced to the principle of ants choosing route.(2)Drawing on the idea of dividing bees in the artificial bee colony algorithm.In this paper,ants are divided into two parts.One part of ants randomly search to increase the solution space,and the other part of ants use the combination method of randomness and determinacy to ensure the convergence of the algorithm.(3)Introduce the idea of preserving the optimal individual of parents in the genetic algorithm.In this paper,the optimal solution of parents is preserved selectively.It depends on the optimal value of parents and the optimal value in the present generation.If the optimal solution of parents is not inferior to the optimal solution in the present generation,the pheromone on the route of both two solutions will increase.Otherwise,the pheromone on the route of the optimal solution and suboptimal solution in the present generation will increase.Finally,the hybrid ant colony algorithm and max-min ant system are used to solve the problem of rural garbage collection routing.After multiple simulation experiments on two sets of data,we can see from the obtained data and graph that the hybrid ant colony algorithm in this paper is superior to the max-min ant system in solving performance and convergence.Then find an optimal garbage collection path for Linglong town of Zhaoyuan City by the improved hybrid ant colony algorithm.We can get the shortest route for garbage trucks by using the hybrid ant colony algorithm to solve the rural garbage collection routing problem.It can save the garbage transportation cost for the rural garbage management system.Then,it can save the funds for government about rural garbage management.