Emergency Supplies Research on Crossing Points of Transport Network Based on Genetic Algorithm

Crossing points are important parts of transport network for emergency supplies. Crossing points contain two parts: one is the point where different paths cross over in a transportation network, the other is the point where different transportation networks cross. The problem to be solved in the paper is to attain a scheduling scheme for emergency supplies in the transport network with crossing points. A mathematical model is established to describe the problem in the paper. The problem is a combination optimization problem. Therefore we supply Genetic Algorithm for solving the problem. The objective in the paper is to acquire a scheme whose time consumption is the least and meanwhile cost consumption is the lowest. Thanks to the computer´s benefits of fast calculation speed, good data storage capacity, scientific calculation, a satisfactory material scheme is acquired through software simulation on the computer.