The preparation of shunting plan of the station is an essential element of rail transport organization. This issue establishes the dynamic programming model of optimal shunting plan in intermediate station according to its requirements and characteristics. Through the analysis of cars' positions and their moving costs, a cost function about most times of moves of cars is established. Meanwhile, an approximation algorithm of potential search is designed. By the combination of the dynamic programming algorithm and potential algorithm, an implicit enumeration algorithm of intermediate station is designed, which has been applied very well in practice.
展开▼
