TY - JOUR
T1 - Time-optimal train traffic in large networks based on a new model
AU - Bavafa-Toosi, Y.
AU - Blendinger, C.
AU - Mehrmann, V.
AU - Ohmori, H.
AU - Steinbrecher, A.
AU - Unger, R.
N1 - Funding Information:
This work was supported in part by Grant No. 03-MEM4B I from The German Ministry of Research and Technology and also in part by a Grant in Aid for the 21 st Century Center of Excellence for "System Design: Paradigm Shift from Intelligence to Life" from The Ministry of Education, Culture, Sport and Technology of Japan.
Publisher Copyright:
© 2004 IFAC.
PY - 2004
Y1 - 2004
N2 - From a system-theoretic standpoint, a constrained state-space model for train traffic in a railway network is developed. It is based on transforming the directed graph of the network to some parallel lists. All the aspects of a real network (such as that of the German Rail) are completely captured by this model. It is generic and can be used to establish an operating system for other large railway networks. By way of 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. 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 (ODE) whereby all the static switching points are computed offline.
AB - From a system-theoretic standpoint, a constrained state-space model for train traffic in a railway network is developed. It is based on transforming the directed graph of the network to some parallel lists. All the aspects of a real network (such as that of the German Rail) are completely captured by this model. It is generic and can be used to establish an operating system for other large railway networks. By way of 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. 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 (ODE) whereby all the static switching points are computed offline.
KW - Boundary value problem
KW - Initial value problem
KW - Large networks
KW - Time optimality
KW - Train traffic
UR - http://www.scopus.com/inward/record.url?scp=85064436810&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85064436810&partnerID=8YFLogxK
U2 - 10.1016/S1474-6670(17)31690-7
DO - 10.1016/S1474-6670(17)31690-7
M3 - Conference article
AN - SCOPUS:85064436810
SN - 1474-6670
VL - 37
SP - 689
EP - 694
JO - IFAC Proceedings Volumes (IFAC-PapersOnline)
JF - IFAC Proceedings Volumes (IFAC-PapersOnline)
IS - 11
T2 - 10th IFAC/IFORS/IMACS/IFIP Symposium on Large Scale Systems: Theory and Applications, LSS 2004
Y2 - 26 July 2004 through 28 July 2004
ER -