Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution

Recent developments in location systems technology for railroads provide a train dispatcher with the capability to improve the operations of a rail line by pacing trains over a territory; i.e., to permit trains to travel at less than maximum velocity to minimize fuel consumption while maintaining a given level of performance. Traditional railroad dispatching models assume that the velocities of the trains moving over a dispatcher's territory are fixed at their maximum value and, thus, are incapable of dealing with a pacing situation. This paper presents a mathematical programming model for the pacing problem and describes alternative solution procedures for this model. Analytical and numerical evidence are presented that confirm the applicability of a heuristic solution procedure for this problem, as well as providing evidence that a pacing approach versus the traditional dispatching approach is an efficient and potentially cost effective method for the control of train movements.

[1]  Ove Frank.  Two-Way Traffic on a Single Line of Railway , 1966, Oper. Res..

[2]  E. R. Petersen.  Over-the-Road Transit Time for a Single Track Railway , 1974 .

[3]  Balder Von Hohenbalken,et al.  Simplicial decomposition in nonlinear programming algorithms , 1977, Math. Program..

[4]  Edward K. Morlok,et al.  Introduction to Transportation Engineering and Planning , 1978 .

[5]  M. Fisher.  Worst-Case Analysis of Heuristic Algorithms , 1980 .

[6]  Arjang A. Assad,et al.  MODELS FOR RAIL TRANSPORTATION , 1980 .

[7]  H L Bongardt.  RAILROAD NETWORK MODELLING : RECENT PRACTICAL APPLICATIONS , 1980 .

[8]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[9]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[10]  A. J. Taylor,et al.  A Structured Model for Rail Line Simulation and Optimization , 1982 .

[11]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

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

[13]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[14]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[15]  Richard C. Grinold,et al.  Model Building Techniques for the Correction of End Effects in Multistage Convex Programs , 1983, Oper. Res..

[16]  Michael A. Saunders,et al.  MINOS 5. 0 user's guide , 1983 .

[17]  Jean-Marc Rousseau,et al.  A Tactical Planning Model for Rail Freight Transportation , 1984, Transp. Sci..

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

[19]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[20]  J. A. Ventura,et al.  Restricted simplicial decomposition: computation and extensions , 1987 .

[21]  Teodor Gabriel Crainic.  RAIL TACTICAL PLANNING: ISSUES, MODELS AND TOOLS , 1988 .

[22]  P T Harker.  THE USE OF SATELLITE TRACKING IN SCHEDULING AND OPERATING RAILROADS : MODELS, ALGORITHMS AND APPLICATIONS , 1989 .

[23]  Patrick T. Harker,et al.  Improving railroad on-time performance: models, algorithms and applications , 1989 .

[24]  S. Zenios,et al.  Simplicial Decomposition for Convex Generalized Networks , 1990 .