Summary
A general method of constructing train connections for given train schedule data is presented. The proposed approach — named TIC (Train InterConnect) — derives a subset of possible train connections between two specified train stations of some railway network using basic schedule data as well as precompiled train connection data. In particular, TIC’s train connection generating algorithm deals with both linear and circular courses. Although the mathematics involved in the TIC approach is rather simple, it is claimed that TIC provides an encompassing formal model for generating train connections. In principle, the proposed approach is extensible easily to other types of traffic connections as well. The present paper only describes TIC’s core procedure deriving course sequences, leaving out the computation of service days and travel times of actual train connections.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dhawan V., Rajput V.S., Asthana R.G.S. (1991) Intelligent Rail—Air Travel Planner. Proc. 7th CAIA (IEEE), pp. 412–418.
Froeschl K.A, Fritz R. (1991) TIC — Automated Generation of Train Connections in a Railway Passenger Consulting System. Technical Report SMC-105.
Manna Z., Waldinger R. (1985) The Logical Basis of Computer Programming: Vol. 1 — Deductive Reasoning. Addison—Wesley, Reading Ma.
Tulp E. (1987) TRAINS. Thesis, Dept. of Mathematics and Computer Science, Free Univ. of Amsterdam.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag/Wien
About this paper
Cite this paper
Froeschl, K.A. (1994). A General Train Connections Generation Procedure. In: Schertler, W., Schmid, B., Tjoa, A.M., Werthner, H. (eds) Information and Communications Technologies in Tourism. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9343-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9343-3_21
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82543-3
Online ISBN: 978-3-7091-9343-3
eBook Packages: Springer Book Archive