Study On Optimal Problems Of The Work Of Disintegration And Mashalling Of Marshalling Station Stage Plan Under Divesion Method

Considering the complexity of the marshalling station,this paper takes the single-directional marshalling station network as the research object to solve the problem of optimal problems of the marshalling station stage plan.On the basis of full axle on time of departure trains,this paper aims at sending out the maximum number of vehicles to the interval and the earliest time to complete the departure operation.It links the multicommodity flow in the minimum cost flow with the direction of wagons flow of the marshalling station,and studies the plan of disintegration and marshalling based on the multicommodity flow method.So the main research contents are as follows:Firstly,the network of marshalling yards is established on the basis of the source of traffic flow,wagon flow group number and the work of disintegration and marshalling,taking class marshalling station with single-direction as an example.In order to find the growing flow conveniently,the network of marshalling station is divided into multicommodity flow network of marshalling station and general network of marshalling station based on the characteristics of traffic flow,so as to meet the traffic demand of nodes representing the completion of aggregation.Then,the general rules of constructing single-direction marshalling station network are given.Secondly,the relationship between multicommodity flow network and marshalling station network is analyzed.Referring to multicommodity flow method,the composite index and parameters of marshalling station network are set up,and the calculation rules are given according to the particularity of marshalling station network of the work of disintegration and marshalling.The cost of uncertainty time in composite parameters is analyzed.The work of disintegration and marshalling,the time occupied to the departure line and the use of shunting locomotive are combined with the network of marshalling station to analyze each operation separately.Then,based on the above constraints,the optimal secondary allocation scheme is obtained,and the flow chain of multicommodity flow network of marshalling station is determined according to the allocation scheme.According to the starting time,the order of flow demand of the assembling operation is determined.According to the flow chain corresponding to the assemblings,the composite index of related disintegration operations is calculated and the order of disintegration is determined.In order to verify the feasibility of the decomposition plan,the shortest time interval occupied to the departure line isdetermined according to the decomposition operation time,and the application plan of the departure line is determined.Finally,an example is given to verify the applicability of the algorithm.The applicability of the algorithm is extended,considering the occupancy area of the shunting locomotive and the condition that the running time can not conflict.On the basis of determining the adjustable interval of the start time of the unmarshalling operation,the shunting yard traffic flow that has not been sent out after the completion of the current stage of the shunting operation is searched for a flow-increasing chain without considering the overload constraint.Adjust the marshalling content of departure trains so that more vehicles can be sent out.