Optimization Model and Algorithm for Train-to-Yard Assignment at Railway Bidirectional Marshalling Stations
This paper studied a train-to-yard assignment optimization problem in the design of operation plans for a rail-way bidirectional marshalling station.Given the information of inbound trains,the information of outbound trains and their assembly requirements,as well as the receiving,departure,disassembly and assembly capacity for each system,this problem lay in flexibly assigning the receiving system for inbound trains and the departure system for outbound trains.According to the technical operation procedures at bidirectional marshalling stations,the studied problem was first formulated as a mixed integer nonlinear programming model to minimize the total dwell time of railcars at the station,which was further transformed into a mixed integer linear programming model.Practical requirements such as the railcar connection restrictions between inbound and outbound trains,the assembly requirements for outbound trains,and the station capacity limitations,were all included into the model.Besides,a genetic algorithm,developed to quickly find near-optimal solution,encoded the receiving system for inbound trains by a binary-based representation,based on which a decoding heuristic was designed to obtain a feasible solution for the original problem.Finally,a realistic case was used to validate the superiority of the proposed approaches compared to the empirical methods used in practice.An analysis was given on the effects of the system disassembly and assembly capacity as well as the system receiving and departure conditions on the performance and results of the proposed approaches.
万方数据
维普
