Font Size: a A A

Research On The Dynamic Plan Of Process Railway Operation

Posted on:2020-02-11Degree:MasterType:Thesis
Country:ChinaCandidate:J H ShiFull Text:PDF
GTID:2381330596998231Subject:Logistics Engineering
Abstract/Summary:PDF Full Text Request
There is a big difference between the process railway operation plan and the general traffic railway operation plan.This paper studies the process railway operation plan based on background of Company B hot metal transportation.In response to the company's current use of manual driving locomotives to transport molten iron,research is being carried out with the goal of developing efficient and intelligent driving plans.In the process of hot metal transportation,the locomotive driver selects the driving route based on past experience,resulting in problems such as inefficient transportation of molten iron and high cost due to insufficient comprehensive information on the operation of the locomotive.Therefore,the realization of the intelligent transportation of hot metal is of great significance to improve the iron and steel transportation efficiency of iron and steel enterprises and reduce the operating costs of enterprises.At the same time,the research in this paper will also provide a basis for the in-depth implementation of unmanned transportation of locomotives.After analyzing the disadvantages of the existing manual transportation of molten iron,this paper proposes to use the shortest driving route and formulate the driving plan to realize the unmanned locomotive in the process of hot metal transportation,so as to realize the intelligentization of molten iron transportation.The main work includes:(1)This paper compares and summarizes the research on locomotive scheduling and hot metal transportation simulation system in the existing hot metal transportation problem,and systematically analyzes the main ideas of A-Star algorithm.(2)Planning of the locomotive driving route.Process railway distance shortest path algorithm problem.The A-Star algorithm is used to solve the problem considering a wide range of path solving and time complexity.(3)Formulation of multi-vehicle operation plan.Aiming at the conflict problem of multiple locomotives running,the road segment resource allocation model with the shortest waiting time of all locomotives is introduced to formulate the open use time of each locomotive for each locomotive,form a driving schedule,and adjust the special situation to achieve the initial driving.Plan for optimization purposes.Analyze and explain the locomotive lock-up status during the actual running of the locomotive,and give the adjustment strategy in various situations.In order to verify the correctness of the above model and algorithm,the article uses the B company's hot metal transportation history as the simulation data source.The final result shows that the whole set of methods proposed in the article can solve the problem of unmanned locomotive in the process of hot metal transportation.The shortest path algorithm can calculate the better path,and the road segment allocation model also Can well arrange the driving plan of multiple locomotives.
Keywords/Search Tags:Steelmaking process railway, Shortest path, A-Star algorithm, Driving plan
PDF Full Text Request
Related items