Optimal Model for Railway Technical Station's Broad Dynamic Wagon-Flow Allocated Problem

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 coordination 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 a station in a stage plan, a mixed integer programming model with multiple objectives has been established to solve this problem. Aiming at this to solve the problem, a local neighborhood search algorithm and a genetic algorithm solving strategy has been designed.


  • English

Media Info

  • Media Type: Web
  • Features: Figures; References; Tables;
  • Pagination: pp 339-344
  • Monograph Title: International Conference on Transportation Engineering 2009

Subject/Index Terms

Filing Info

  • Accession Number: 01534724
  • Record Type: Publication
  • ISBN: 9780784410394
  • Files: TRIS, ASCE
  • Created Date: Nov 12 2013 1:44PM