Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
525481 | Transportation Research Part C: Emerging Technologies | 2009 | 15 Pages |
Abstract
This paper considers the problem of reducing the time that empty cars spend in classification yards of rail systems operating under real-time information and automated schedule-adjustment technologies. The proposed methodology performs dynamic reassignments of empty cars through a fast and efficient solution procedure based on the assignment algorithm. The procedure has been tested on real-life data from one of the major railroads in North America. Computational results show that the procedure runs fast and yields savings in the time that the empty cars spend in the yard.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Tolga Bektaş, Teodor Gabriel Crainic, Vincent Morency,