By Topic

A New Methodology for Modeling, Analysis, Synthesis, and Simulation of Time-Optimal Train Traffic in Large Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

From a system-theoretic standpoint, a constrained state-space model for train traffic in a large railway network is developed. The novelty of the work is the transformation or rather reduction of the directed graph of the network to some parallel lists. Mathematization of this sophisticated problem is thus circumvented. All the aspects of a real network (such as that of the German rail) are completely captured by this model. Some degrees of freedom, as well as some robustness can be injected into the operation of the system. The problem of time-optimal train traffic in large networks is then defined and solved using the maximum principle. The solution is obtained by reducing the boundary value problem arising from the time-optimality criterion to an initial value problem for an ordinary differential equation. A taxonomy of all possible switching points of the control actions is presented. The proposed approach is expected to result in faster-than-real-time simulation of time-optimal traffic in large networks and, thus, facilitation of real-time control of the network by dispatchers. This expectation is quantitatively justified by analysis of simulation results of some small parts of the German rail network.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:5 ,  Issue: 1 )