Affiliation:
1. University of Southern California, Los Angeles, CA
2. University of California, Berkeley, CA
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modelling and Simulation
Reference13 articles.
1. Bueche F. Hecht E. and Bueche F. J. 1997. Schaum's Outline of College Physics. McGraw-Hill New York NY. Bueche F. Hecht E. and Bueche F. J. 1997. Schaum's Outline of College Physics. McGraw-Hill New York NY.
2. A model, algorithm and strategy for train pathing, with choice of lines, platforms and routes;Carey M.;Trans. Res. 28(B), 333--353.,1994
3. Hybrid simulation for resolving resource conflicts in train traffic rescheduling
4. A simulation modeling methodology for analyzing large complex rail networks;Dessouky M. M.;Simulation,1995
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献