Reasonable Sequence of Placing-In and Taking-Out of Freight Cars for Branch-Shaped Sidings by Adoption of Dynamic Programming Model
The operation for placing-in and taking-out of freight cars on branch-shaped sidings is analyzed and categorized into a similar traveling salesman problem (TSP), so as to determine a function to calculate the minimum car-hours (car-kilometers) consumed. A corresponding mathematically optimized dynamic programming model is built and is tested in combination with a case study. According to the results, the model is feasible and effective.
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784411841
-
Supplemental Notes:
- Copyright © 2011 ASCE
-
Corporate Authors:
American Society of Civil Engineers
1801 Alexander Bell Drive
Reston, VA United States 20191-4400 -
Authors:
- Li, Hongyan
- Yang, Xinchun
- Yan, Haifeng
-
Conference:
- Third International Conference on Transportation Engineering (ICTE)
- Location: Chengdu , China
- Date: 2011-7-23 to 2011-7-25
- Publication Date: 2011
Language
- English
Media Info
- Media Type: Digital/other
- Features: Figures; References;
- Pagination: pp 37-42
- Monograph Title: ICTE 2011
Subject/Index Terms
- TRT Terms: Car distribution (Railroads); Dynamic models; Dynamic programming; Freight cars; Freight transportation; Loading and unloading; Railroad transportation; Traveling salesman problem
- Subject Areas: Freight Transportation; Planning and Forecasting; Railroads; I72: Traffic and Transport Planning;
Filing Info
- Accession Number: 01447612
- Record Type: Publication
- ISBN: 9780784411841
- Files: TRIS, ASCE
- Created Date: Sep 28 2012 9:11AM