The Optimization Of Refuse Collection Vehicle Routing And Application

On the basis of the analysis of the characteristic of refuse collection system,it presents refuse collection vehicle routing problem according to the existing collection.mode of municipal solid waste.A vehicle's tour means the total course driven since departing from the depot,until returning back 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 initial trips,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.After researching the object function and the constraits,the mathematical model of the refuse collection vehicle routing problem is formulated.The object function includes the collection cost and the deadheading cost.The constraints include the common constraints of Vehicle Routing Problem(VRP) and the constraints defining the three sorts of trips.The dissertation presents a heuristic algorithm of modified Minimum Spanning Tree(MST) for solving the mathematical model of the refuse collection problem.After the analysis and elaboration of the theoretical basis and thought of the heuristic,it presents the methods and steps to compute the vehicle routing applied to a simulated collection network.Wth the real refuse collection system of Lanyuan area of Xuanwu distict in Nanjing,it use the heuristic algorithm to program the routing of refuse collection vehicles.Compared to the existing collection route,the distance of optimal route reduces by 29%.