An integrated dispatching model for rail yards operations

Abstract

Rail yards dispatcher must determine (1) how cars are transferred from one inbound train to another outbound train and what is the makeup of each outbound train, (2) how to use yard engines, (3) how to arrange yard track occupation. The sum total of these decisions is the basis of other decisions in rail yards. This paper presents the formulation and solution of a joint computer-aided dispatching model for the coordination of the above decisions. The objective here is to capture the tradeoff between benefits of reducing the staying time of cars in yards and the delay penalty costs. This formulation results in a mixed 0–1 programming and an optimal decomposing heuristic solution method is proposed. The tests with the practical instances demonstrate the reliability and efficiency of the algorithm. Scope and purpose In this paper we study the train scheduling and yards planning decisions of rail operations. Train scheduling problem is concerned with assigning trains and train times for a set of rail lines and station stops. A yard planning is the detailed arrangements of the yards activities concerned with trains’ classification or assembly. Given a variety of constraints, the objective of the paper is to determine solutions to this complicated problem in rail yard operations in China. In addition, a computer-aided decision support system is developed that will assist in the improvement of management efficiency in operations of railroads.