Research On Automatic Compilation And Adjustment Of Daily Plan Of Enterprise Railway Intelligent Scheduling System

Railway transportation is an important part of enterprise production chain. For a longtime, the operating type of enterprise railway dispatching work is relatively backward, whichleads to frequent occurrence of various types of problems. With the continual expansion ofenterprise production scale, the contradiction between traffic volume and transportationcapacity is becoming more and more significant, and the railway transportation hasincreasingly become a “bottleneck” that hinders the development of enterprises. Daily plan,which is the core of railway dispatching work, its organization quality has direct bearing onthe production efficiency and order of Enterprise transportation. Therefore, it is necessary tostudy enterprise railway daily plan to realize the automatic compilation and optimizationprogram of daily plan and improve the efficiency of railway transportation.At first, this dissertation introduces the background and significance of the selectedsubject, and summarizes the problems and difficulties of organization enterprise railway dailyplan, which based on the analysis of research status of domestic and foreign related theoriesand application field. At the same time, it summarizes the current existing problems inrailway transport based on the present situation of the enterprise railway transport, sorts outthe existing railway line, the internal enterprises and enterprises trains of our country,elaborates and analyzes transport organization and operation process of enterprise railway,and discusses the function and characteristics of enterprises railway transport. All these worklays the foundation for further research on this subject.Then, this thesis analyzes and expounds the contents, principles and information neededto collect of enterprise railway daily plan, using this as a foundation, the substance oforganization problem of daily plan is to correctly calculate the process of reasonablecollocation of traffic flow. Because of many influence factors of daily plan process, thisdissertation establishes the constraint conditions for the formal description of these factors.The concrete constraint conditions include constraint of marshalling plan, constraint oflocomotive hauling fixed number, constraint of vehicle in place of time, constraint ofevacuation plan, constraint of loading plan, constraint of unloading plan and constraint ofpositive integer and so on. Afterwards, aimed at the goal of the shortest time for the stay timeof vehicles in the factory and minimum number of locomotive operation, it considers thecomplex problem of the whole enterprise of each locomotive station using and train operationplan and loading, unloading, evacuation plans and so on.In addition, based on the analysis and reference of the research results of method forsolving daily plan, this article designs the solving thoughts of the model, determines thecalculation method for the each sub-plan of daily plan, analyzes the conflict and relief way in vehicle connection optimization, successively filters the vehicle resources according to theconstraints, gets the needed vehicles of outgoing train classification that complies with therequirements, and guarantees the punctual and full axis starting of outgoing trains. Meanwhile,in this thesis, the causes of the imbalance transportation and optimization measures areoffered. In order to verify the validity of the established model and algorithm, the livingexamples are introduced to analyze in the fifth chapter.Finally, on the basis of the above research, this thesis develops the automaticcompilation and adjustment platform of daily plan of railway intelligent scheduling system.This software realizes the functions of automatic compilation and adjustment of enterpriserailway daily plan and information query. The dissertation gives the framework, overalldesign and the realization of function module of the system, which also proves the feasibilityand practicability of the theory and method.