Abstract

Abstract Freight car scheduling is taking on a more important role in rail operating plans as more shippers demand trip plan information for their procurement, production and distribution plans, and as railroads pursue operations that are better scheduled and planned. This paper presents several ways to improve current freight car scheduling practices and describes a dynamic freight car routing and scheduling model that can produce more achievable and market-sensitive car schedules. A time–space network representation technique was used to represent car moves on possible sequences of car-to-block and block-to-train assignments on a general-merchandise rail service network. The problem was formulated as a linear multicommodity flow problem; the column generation technique was used as a solution approach. The model was tested on a hypothetical rail network based on the sub-network of a major U.S. railroad.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.