Research On The Programming Problem Of Railway Construction Material Supply Network

With the carrying out of large-scale domestics railway constructions, the material supply problem of railway construction goes into more and more important. In this paper, form the view point of controlling cost and meeting material demand, research on the programming problem of railway construction material supply network is made. Based on analysis of the analysis about the railway construction material supply network's characteristic demand applicable model for compositive problem of location and routing is proposed. A two-phase heuristic approach for solving this LRP is proposed. This two-phase heuristic approach is on basis of minimum wrap-net method and genetic algorithm. Through a numerical example, the applicability and superiority of the algorithm are verified. In the model and algorithm proposed, the characteristics of railway construction material supply problem are emphasized. The concept of material preparing cost is proposed to reflect the problem across-the-board. In the second phase of the algorithm, the applicability of genetic algorithm is fully shown. The cross and rupture of sub string are used to give birth to new vehicle routes.