Algorithm research on train movement simulation and routing optimization in railway stations
To route planning problem for trains in station throat areas,this study investigates optimiza-tion algorithms under scenarios involving the actual station throat layout,train routing within the throat area,train length,and speed.First,a time-space network is constructed to represent train movements in the station throat area,framing the routing problem as a time-space allocation issue with limited resources.A network flow model is then established.Subsequently,an algorithm based on a discrete event model is developed to simulate train operation plans in the station throat area,given a predefined train priority sequence,resulting in feasible routing solutions.Furthermore,a train priority sequence optimization algorithm,utilizing the Tabu Search(TS)algorithm,is developed to minimize operational delays.Finally,the throat area of a specific station is analyzed as a case study.Results demonstrate that the proposed TS-based priority optimization algorithm effectively resolves train routing conflicts in the station throat area,optimizes delay and waiting times,and achieves con-vergence within 4 minutes to provide a satisfactory routing solution.
万方数据
维普
