The Route About Transportation Of Dangerous Goods On Ant Colony Algorithm

In recent years, the big dangerous goods reveal and pollution accidents which appear continuously caused great damage to the national economy, peoples' life property and the environment resourceses. In order to avoid dangerose goods damaging people and geographical environment of highway when the accidents happen and realizes maximal dangerous freight enterprise beneficial result, A main question about transportation of Dangerous Goods by automobile is how to choose the best transportation route of transportation of Dangerous Goods.The dissertation (focuses on the principles and theory of Ant Colony Algorithm, especially, an study on how to improve the basic Ant Colony Algorithm, solving transportation of Dangerous Goods by automobile. The main achievements of this dissertation include:1,According to the princple and the character of transportation route optimized about transportation of Dangerous Goods, On the basis of a form abuot classics VRP model transportation circuit, the model CVRP of the transportation of Dangerous Goods by automobile was proposed.2,The dissertation expresses the model of formula, analyzes the model of section risk and proposes the conception of the section weighting value. Then lead the section weighting value into the probability of going to the next city of the Ant Colony Algorithm. The purpose is to consider the effects of road section risk when the ant choose the route.With Matalab language, this dissertation programs the procedures of the route about transportation of Dangerous Goods based on an improved Ant Colony Algorithm,and then apply the procedures to the problem of transportation of Dangerous Goods.With the considering of road section risk, the Vehicle does not choose the section of no entrying and the high degree of road section risk.