The Model and Algorithm of the Railway Technical Station's Broad Static Wagon-Flow Allocated Problem

The railway technical station's Broad Static Wagon-Flow Allocated Problem (BSWFAP) is related to design an optimal way to allocate wagon flows after the train sorting and classification sequence is determined, which is based on comprehensively taking the Train Classified Rules, Train Stop Rules into account. Firstly introducing two concepts which were the earliest train sorting end time and the latest train classification start time; secondly based on the relationship between arrival and departure train in the link of time and wagon flow connection, a nonlinear mixed integer programming model with multiple objective functions was established; thirdly based on the hardly to solve character of that model, a arrival and departure train set concept was introduced and a search algorithm was designed.