Abstract
This paper deals with problems in schedule synchronization for public transit networks. First we reformulate the problem of minimizing waiting times of passengers changing communication routes at certain transfer stations in a network. In this problem all transit lines only meet at certain points or transfer stations. A second problem, in addition, considers the case where different lines partly use the same tracks implicating that security distances have to be observed.
For both problems identical solution methods are described and tested on real world as well as on randomly generated data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P. and J. Hurink (1986). A railway scheduling problem. Zeitschrift für Operations Research 30, A223 — A227.
Chhajed, D. and T.J. Lowe (1990). M-median and M-center problems with mutual communication: solvable special cases. Working paper, University of Illinois Urbana — Champaign.
Dammeyer, F., P. Forst and S. Voß (1990). On the cancellation sequence method of tabu search. Working paper, FG Operations Research, TH Darmstadt.
Desilets, A. and J.-M. Rousseau (1990). SYNCRO: A computer — assisted tool for synchronization of transfers in public transit networks. Paper presented at the 5th Workshop on Computer-Aided Scheduling of Public Transport, Montreal.
Domschke, W. (1989). Schedule synchronization for public transit networks. OR Spektrum 11, 17–24.
Glover, F. (1989). Tabu search — part I. ORSA Journal on Computing 1, 190 – 206.
Glover, F. (1990). Tabu search — part II. ORSA Journal on Computing 2, 4 – 32.
Gupta, A.K. and P. Vrat (1981). Simulation model for optimal frequency of buses on a route — a case study. In: Scientific Management of Transport Systems (N.K. Jaiswal, ed.), pp. 225 – 234. North-Holland, Amsterdam.
Hall, R.W. (1987). Passenger delay in a rapid transit station. Transportation Science 21, 279 – 292.
Holz, S. and R. Hüttmann (1987). Optimierung von Anschlußzeiten. Der Nahverkehr Heft 4.
Keudel, W. (1988). Computer — aided line network design (DIANA) and minimization of transfer times in networks (FABIAN). In: Computer-Aided Transit Scheduling (J.R. Daduna and A. Wren, eds.), Lecture Notes in Economics and Mathematical Systems 308, pp. 315–326. Springer, Berlin.
Klemt, W.D. and W. Stemme (1988). Schedule synchronization for public transit networks. In: Computer-Aided Transit Scheduling (J.R. Daduna and A. Wren, eds.), Lecture Notes in Economics and Mathematical Systems 308, pp. 327 – 335. Springer, Berlin.
Koutsopoulos, H.N., A.R. Odoni and N.H.M. Wilson (1985). Determination of headways as a function of time varying characteristics on a transit network. In: Computer Scheduling of Public Transport 2 (J.- M. Rousseau, ed.), pp. 391 – 413, North-Holland, Amsterdam.
Kuah, G.K. ana J. Perl (1989). Tne feeder-bus network — design problem. Journal of the Operational Research Society 40, 751 – 767.
Kwan, R.S.K. (1988). Co — ordination of joint headways. In: Computer-Aided Transit Scheduling (J.R. Daduna and A. Wren, eds.), Lecture Notes in Economics and Mathematical Systems 308, pp. 304–314. Springer, Berlin.
Leblanc, L.J. (1988). Transit system network design. Transportation Research 22, B383 — B390.
Noltemeier, H. (1976). Graphentheorie. De Gruyter, Berlin, New York.
Norman, J. (1986). The provision of real — time departure information for passengers of a rail-bus interchange. Traffic Engineering and Control 27, 447–451.
Rardin, K.L., R.G. Parker and M.B. Richey (1982). A polynomial algorithm for a class of Steiner tree problems on graphs. Rep. Series J — 82 – 5, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta GA.
Simeone, B. (1986). An asymptotically exact polynomial algorithm for equipartition problems. Discrete Applied Mathematics 14, 283 – 293.
Skorin-Kapov, J. (1990). Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2, 33 – 45.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voß, S. (1992). Network Design Formulations in Schedule Synchronization. In: Desrochers, M., Rousseau, JM. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85968-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-85968-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55634-3
Online ISBN: 978-3-642-85968-7
eBook Packages: Springer Book Archive