The railway technical station's Broad Dynamic Wagon-Flow Allocated Problem (BDWFAP) is related to design an optimum way to get the railway technical station's Static Wagon-Flow Allocated Process (SWFAP) in coordinate with the Adjusting the Train Sorting and Classification Sequence Process, which is based on comprehensively taking the Train Classified Rules, Train Stop Rules, and the Relationships between Arrival and Departure Trains into account. Respectively aiming at maximizing the number of departure trains, maximizing the number of departure wagon flows and minimizing the average transfer time per wagon flow staying idle at station in a stage plan, a mixed integer programming model with multiple objectives has been established to this problem. Aiming at this hardly to solve problem, local neighborhood search algorithm and genetic algorithm solving strategy has been designed.
Optimal Model for Railway Technical Station's Broad Dynamic Wagon-Flow Allocated Problem
Second International Conference on Transportation Engineering ; 2009 ; Southwest Jiaotong University, Chengdu, China
29.07.2009
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Optimal Model for Railway Technical Station's Broad Dynamic Wagon-Flow Allocated Problem
British Library Conference Proceedings | 2009
|The Model and Algorithm of the Railway Technical Station's Broad Static Wagon-Flow Allocated Problem
British Library Conference Proceedings | 2009
|