Font Size: a A A

Research And Implementation Of Vehicle Scheduling Optimization Algorithm Based On The Constrained Line Of Railway Stations

Posted on:2015-02-03Degree:MasterType:Thesis
Country:ChinaCandidate:Y H GuoFull Text:PDF
GTID:2268330428472552Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
This article takes the rail yards of a company’s logistics distribution center as the study background. For the problem existing in train scheduling, such as complexity of shunting operation, limited capacity of train line, low efficiency of shunting operation and high cost of transportation problem, the author established a model by which shunting operation plan can be be generated automatically according to the situation of lines and trains on the lines, and put forward an optimization scheduling algorithm.The optimization scheduling algorithm this paper put forward consists of two parts. One is to optimize the train marshalling to make the trains in accordance with the trays order and to get the least marshalling sequence, under the condition of limited length of marshalling lines, according to trays order the trains send to; The other one is to optimize scheduling path after the marshalling optimization of trains, enabling the locomotive schedules all trains to corresponding position and shortest scheduling path length, according to the optimized path.In the train-mashall optimization algorithm, firstly use the method of the line priority judgment to calculate the priorities of all lines before every operation of pick and unpick, then choose the best line for the operation of pick and unpick, ensure that every operation is optimal operation in the current circumstances. Then on this basis, use the genetic algorithm to solve the shotest operation sequence of pick and unpick.In train scheduling optimization algorithm, firstly take the internal site and railway station as vertices and the distances as the arc length to turn the line topology into the undirected graph, and then translate the train scheduling problem into the shortest travel path problem of undirected graph, finally use simulated annealing algorithm to solve the shortest travel path of undirected graph.Finally apply the research achievement to a company’s train information management system of rail yards and enable automatic generation of the scheduling operation plan of trains, make the company’s numbers of marshalling shunting operations and shunting trip distance reduced and shunting operation efficiency greatly improved.
Keywords/Search Tags:Rail yard, line constraints, train scheduling
PDF Full Text Request
Related items