An integrated dispatching model for rail yards operations

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.

[1]  Patrick T. Harker,et al.  Tactical Scheduling of Rail Operations: The SCAN I System , 1991, Transp. Sci..

[2]  Richard L. Sauder,et al.  Computer aided train dispatching: decision support through optimization , 1983 .

[3]  Patrick T. Harker,et al.  Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution , 1991, Oper. Res..

[4]  E. R. Petersen.  Railyard Modeling: Part I. Prediction of Put-Through Time , 1977 .

[5]  Mark S. Daskin,et al.  Queuing Models of Classification and Connection Delay in Railyards , 1982 .

[6]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[7]  E. R. Petersen.  Railyard Modeling: Part II. The Effect of Yard Facilities on Congestion , 1977 .

[8]  Erhan Kozan,et al.  Optimal scheduling of trains on a single line track , 1996 .

[9]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[10]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[11]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[12]  Malachy Carey,et al.  Extending a train pathing model from one-way to two-way track , 1994 .

[13]  A. J. Taylor,et al.  An introduction to computer‐assisted train dispatch , 1986 .

[14]  Rui Song,et al.  The synthetical optimization of railway hub shift working plan , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).

[15]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[16]  Eugene L. Lawler,et al.  Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory , 1993 .

[17]  Robert L. Bulfin,et al.  Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs , 1983 .