Study On The Optimization Of Collection And Transportation Rout Of Food Waste Based On The Improved Ant Colony Algorithm

With the accelerated process of urbanization and the improvement of people’s living standards,food waste is produced more and more.Nowadays the study of food waste basically stay in the end control and source control, paying little attention to the food waste collection and transportation route,to bring the adverse of economic,social,environmental benefit.Research on the collection and transportation route: only researching on the collection and transportation route, unite the actual collection and transportation system is less;only researching on single-vehicle type mathematical model, multi-vehicle type mathematical model is less; only using separate ant colony optimization and genetic algorithm to solve, the algorithm of the own improved ant colony algorithm and the fusion of genetic algorithm are less.In the paper,three content in food waste collection and transportation routing problem as the breakthrough point, to explore that study on the optimization of collection and transportation rout of food waste based on the improved ant colony algorithm.Through analyzing of the each factor of collection and transportation system of food waste qualitatively and quantificationally,unite the present situation of food waste collection and transportation and the scene investigation,analysing a food waste collection and transportation system in Chongqing;On the basis of it,proposed food waste collection and transportation route optimization problem in Chongqing.The collection and transportation routes of food waste in Chongqing is that a vehicle’s tour means the total course driven since departing from the depot until returningback to it.During the tour, a refuse collection vehicle steers among depot,collection area,transition station(disposal facility).Each tour is a sequence of three sorts of trips: the initialtrips,from the depot to collection area,then to transition station(disposal facility),the intermediate trips,which may exist once or more in a tour,from the transition station(disposal facility) to collection area then back to transition station(disposal facility),the final trips from transition station(disposal facility) back to the depot.In this paper,establishing the weights of network’s single-vehicle and multi-vehicle type models for the actual problems by putting to use the knowledge of graph theory and network flow in optimization theory,and having an analysis and research on the the objective function and constraint conditions of models, then to solve practical problems by improved ant colony algorithm.Research on Algorithm for solving the problem of waste collection and transportation routes, a separate ant colony algorithm and genetic algorithm can’t have it both ways in terms of solution of time and accuracy,so select the improved ant colony algorithm, there are two aspects: the own improvement and the improvement of the fusion of genetic algorithm,the own improvement:parameter selection optimization and ant colony system.The first example of the optimized parameters of ant colony algorithm; the second examples to illustrate DAAGA in the solution of VRP, solution properties are better than AA,GA,ACS,ACSGA.Finally,taking Chongqing city as example one of Jiangbei District, Shapingba district as example two, based on the actual food waste collection and transportation system,using DAAGA to optimize the food waste collection and transportation routes, which using Collection point combination,the clustering partition and waste allocation technology in the process of research. For the example one: Jiangbei District, comparing case one with case two, case three and case four results, draw the conclusion: The food waste collection and transportation route which is optimized by DAAGA, multi-vehicle type model, Class A transport and collection mode is better than the three kinds of the food waste collection and transportation route which are the direct collection and transportation model, single-vehicle type model and the actual situation in the case of Jiangbei.In the example two: Shapingba District, the optimal situation will be used in the Shapingba District of food waste collection and transportation routes,obtained the ideal result, the established model, the algorithm can also be used in other cases,it is proved that the feasibility and universality.