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 non-linear 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.
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784410394
-
Supplemental Notes:
- © 2009 American Society of Civil Engineering.
-
Corporate Authors:
American Society of Civil Engineers
1801 Alexander Bell Drive
Reston, VA United States 20191-4400 -
Authors:
- Tang, Zihan
- Zhaq, Jun
-
Conference:
- Second International Conference on Transportation Engineering
- Location: Chengdu , China
- Date: 2009-7-25 to 2009-7-27
- Publication Date: 2009-7
Language
- English
Media Info
- Media Type: Web
- Features: Figures; References; Tables;
- Pagination: pp 345-350
- Monograph Title: International Conference on Transportation Engineering 2009
Subject/Index Terms
- TRT Terms: Algorithms; Freight cars; Mixed integer programming; Optimization; Railroad stations; Traffic flow
- Subject Areas: Freight Transportation; Operations and Traffic Management; Railroads; Terminals and Facilities; I70: Traffic and Transport;
Filing Info
- Accession Number: 01534732
- Record Type: Publication
- ISBN: 9780784410394
- Files: TRIS, ASCE
- Created Date: Aug 15 2014 2:18PM