2002•Journal of the Transportation Research ForumRequires access

PRIORITY-BASED CLASSIFICATION FOR IMPROVING CONNECTION RELIABILITY IN RAILROAD YARDS. PART I OF II: INTEGRATION WITH CAR SCHEDULING

E R Kraft

Open publisher page 10 citations

Abstract

Railroads must be able to provide reliable service with a guaranteed delivery time in order to attract new business and compete with trucking operations. Better control of railroad yard and terminal operations is essential. If available space on a train is sold out, a capability in railyards to ensure connections of railcars needing to move on specific trains becomes essential, so cars with no remaining schedule slack time (where a missed connection would result in a service failure) have first access to remaining train capacity. This two-part paper explores the relationship between priority-based classification and dynamic car scheduling and how railroads can used those methods to improve service and reduce cost. To guarantee connections of cars with no remaining schedule slack time, a sufficient number of low priority cars can be diverted at the hump instead of cherry-picking high priority cars at the trim end of the yard. The process of determining necessary diversions at the hump implements the process of rescheduling cars in excess of train capacity to later trains, or, in the case of dynamic car scheduling, redirecting cars into other classifications to move via a different set of intermediate yards. By combining a scheduled railroad with new dynamic car scheduling and priority-based classification capabilities in yards, highly reliable service can be provided without sacrificing train capacity utilization. Part II of the paper will present procedures for finding a set of train-blocks that can fit into available classification tracks.

About this research paper

What this paper is about

Railroads must be able to provide reliable service with a guaranteed delivery time in order to attract new business and compete with trucking operations. Better control of railroad yard and terminal operations is essential. If available space on a train is sold out, a capability in railyards to ensure connections of railcars needing to move on specific trains becomes essential, so cars with no remaining schedule slack time (where a missed connection would result in a service failure) have first access to remaining train capacity. This two-part paper explores the relationship between priority-based classification and dynamic car scheduling and how railroads can used those methods to improve service and reduce cost. To guarantee connections of cars with no remaining schedule slack time, a sufficient number of low priority cars can be diverted at the hump instead of cherry-picking high priority cars at the trim end of the yard. The process of determining necessary diversions at the hump implements the process of rescheduling cars in excess of train capacity to later trains, or, in the case of dynamic car scheduling, redirecting cars into other classifications to move via a different set of intermediate yards. By combining a scheduled railroad with new dynamic car scheduling and priority-based classification capabilities in yards, highly reliable service can be provided without sacrificing train capacity utilization. Part II of the paper will present procedures for finding a set of train-blocks that can fit into available classification tracks.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Railroads must be able to provide reliable service with a guaranteed delivery time in order to attract new business and compete with trucking operations. Better control of railroad yard and terminal operations is essential. If available space on a train is sold out, a capability in railyards to ensure connections of railcars needing to move on specific trains becomes essential, so cars with no remaining schedule slack time (where a missed connection would result in a service failure) have first access to remaining train capacity. This two-part paper explores the relationship between priority-based classification and dynamic car scheduling and how railroads can used those methods to improve service and reduce cost. To guarantee connections of cars with no remaining schedule slack time, a sufficient number of low priority cars can be diverted at the hump instead of cherry-picking high priority cars at the trim end of the yard. The process of determining necessary diversions at the hump implements the process of rescheduling cars in excess of train capacity to later trains, or, in the case of dynamic car scheduling, redirecting cars into other classifications to move via a different set of intermediate yards. By combining a scheduled railroad with new dynamic car scheduling and priority-based classification capabilities in yards, highly reliable service can be provided without sacrificing train capacity utilization. Part II of the paper will present procedures for finding a set of train-blocks that can fit into available classification tracks.

Key concepts: Train, Yard, Scheduling (production processes), Rail freight transport, Schedule, Transport engineering, Operations research, Engineering

Related papers

Back to paper searchBrowse research topicsOriginal source
PRIORITY-BASED CLASSIFICATION FOR IMPROVING CONNECTION RELIABILITY IN RAILROAD YARDS. PART I OF II: INTEGRATION WITH CAR SCHEDULING — Research Paper | ScholarLens