Modeling train movements through complex rail networks

ABSTRACT

Trains operating in densely populated metropolitan areas typically encounter complex trackage configurations. To make optimal use of the available rail capacity, some portions of the rail network may consist of single-track lines while other locations may consist of double- or triple-track lines. Because of varying local conditions, different points in the rail network may have different speed limits. We formulate a graphical technique for modeling such complex rail networks; and we use this technique to develop a deadlock-free algorithm for dispatching each train to its destination with nearly minimal travel time while (a) abiding by the speed limits at each point on each train's route, and (b) maintaining adequate headways between trains. We implemented this train-dispatching algorithm in a simulation model of the movements of passenger and freight trains in Los Angeles County, and we validated the simulation as yielding an adequate approximation to the current system performance.

REFERENCES

• 1: Bueche, F., Hecht, E., and Bueche, F. J. 1997. Schaum's Outline of College Physics. McGraw-Hill, New York, NY.
• 2: Carey, M. 1994. A model, algorithm and strategy for train pathing, with choice of lines, platforms and routes. Trans. Res. 28(B), 333--353.
• 3: Yu Cheng, Hybrid simulation for resolving resource conflict in train traffic rescheduling, Computers in Industry, v.35 n.3, p.233-246, April 1, 1998 [doi>10.1016/S0166-3615(97)00071-7]
• 4: Dessouky, M. M. and Leachman, R. C. 1995. A simulation modeling methodology for analyzing large complex rail networks. Simulation 65, 2, 131--142.
• 5: Maged M. Dessouky , Quan Lu , Robert C. Leachman, Modeling very large scale systems: using simulation modeling to assess rail track infrastructure in densely trafficked metropolitan areas, Proceedings of the 34th conference on Winter simulation: exploring new frontiers, December 08-11, 2002, San Diego, California
• 6: A. N. Habermann, Prevention of system deadlocks, Communications of the ACM, v.12 n.7, p.373-ff., July 1969 [doi>10.1145/363156.363160]
• 7: A. Higgins , E. Kozan, Modeling Train Delays in Urban Networks, Transportation Science, v.32 n.4, p.346-357, April 1998 [doi>10.1287/trsc.32.4.346]
• 8: Komaya, K. 1991. A new simulation method and its application to knowledge-based systems for railway scheduling. In Proceedings of the IEEE/ASME Joint Railway Conference (St. Louis, MO, May). IEEE/ASME, New York, NY, 59--66.
• 9: Lawley, M. A. and Reveliotis, S. A. 2001. Deadlock avoidance for sequential resource allocation systems: Hard and easy cases. Internat. J. FMS 13, 4, 385--404.
• 10: Leachman, R. C. 1991. Railroad capacity and operations analysis for the Alameda Consolidated Transportation Corridor Project. Tech. rep. Leachman & Associates, Berkeley, CA.
• 11: Myron Lewellen , Kerim Tumay, Network simulation of a major railroad, Proceedings of the 30th conference on Winter simulation, p.1135-1138, December 13-16, 1998, Washington, D.C., United States
• 12: Petersen, E. R. and Taylor, A. J. 1982. A structured model for rail line simulation and optimization. Transport. Sci. 16, 2, 192--206.
• 13: Vickerman, M. J. 1998. Next-generation container vessels: Impact on transportation infrastructure an operation. TR News 196, 3--15.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.3 Applications

Additional Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.5 Model Development
          Subjects: Modeling methodologies

General Terms:
Algorithms, Performance

Keywords:
Trains, deadlock, dispatching, modeling