Abstract
In complex networks schedule synchronization has a major importance when constructing timetables. Restrictions in this field are based on the structure and the complexity of the existing network, different headways, and the origin-destination pairs of the demand structure. With respect to service quality one main objective coming to mind consists of minimizing the sum of all waiting times of all passengers at transfer nodes in a transit system. Furthermore, modifications of such an objective function incorporating the maximum waiting time may have to be observed as well as interrelationships between service level and operating cost.
Due to the problems’ complexity a number of heuristic solution procedures has been developed for schedule synchronization. In a moderate number of case studies for some public transport networks of German cities we applied a regret heuristic together with some improvement strategies, i.e., simulated annealing and tabu search. Within the latter strategy modifications of a dynamic tabu list management including a look ahead method have been tested. Numerical results are reported and the obtained timetables based on our heuristic approach clearly underline its advantage over previously applied planning tools.
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
Aarts, E. / Korst, J. (1989): Simulated annealing and Boltzmann machines. (Wiley) Chichester.
Adamski, A. (1993): Transfer optimization in public transport. Paper presented at the 6th International Workshop on Computer-Aided Scheduling of Public Transport, 06-09 July, Lisbon, Portugal
Bookbinder, J.H./ Désuets, A. (1992): Transfer optimization in a transit network. in: Transportation Sience 26, 106–118
Ceder, A. (1991): A procedure to adjust transit trip departure times through minimizing the maximum headway. in: Computers &Operations Research 18, 417–431
Chhajed, D. / Lowe, TJ. (1992): M-median and m-center problems with mutual communication: solvable special cases. in: Operations Research 40, S56–S66
Daduna, J.R. (1990): Neue Ansätze zur Anschlußplanung in Verkehrsnetzen. Paper presented at the 11th International Conference on Regional Transport from UITP, Newcastle upon Tyne
Daduna, J.R. / Mojsilovic, M. / Schütze, P. (1993): Practical experiences using an interactive optimization procedure for vehicle scheduling. in: Du, D.-Z. / Pardalos, P. (eds.); Network Optimization Problems, (World Scientific) Singapore, New Jersey, London, Hong Kong, 37–52
Dammeyer, F. / Forst, P./ Voß, S. (1991): On the cancellation sequence method of tabu search. in: ORSA Journal on Computing 3, 262–265
Dammeyer, F. / Voß, S. (1993): Dynamic tabu list management using the reverse elimination method. in: Annals of Operations Research 41, 31–46
Désilets, A./ Rousseau, J.-M. (1992): SYNCRO: A computer-assisted tool for the synchronization of transfers in public transit networks. in: Desrochers, M. / Rousseau, J.-M. (eds.); Computer-Aided Transit Scheduling, (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo, 153–166
Domschke, W. (1989): Schedule synchronization for public transit networks. in: OR Spektrum 11, 17–24
Domschke, W./ Forst, P./Voß, S. (1992): Tabu search techniques for the quadratic semi-assignment problem. in: Fandel, G. / Gulledge, T. / Jones, A. (eds.); New Directions for Operations Research in Manufacturing, (Springer) Berlin, 389–405
Dutta, A. / Koehler, G. / Whinston, A. (1982): On optimal allocation in a distributed processing environment. in: Management Science 28, 839–853
Fleischmann, B. (1990): Cyclic schedules in a mass transit network. Paper presented at the 12th Triennial Conference on Operations Research IFORS ′90, Athens
Glover, F. (1989): Tabu search — Part I. in: ORSA Journal on Computing 1, 190–206
Glover, F. (1990): Tabu search — Part II. in: ORSA Journal on Computing 2, 4–32
Glover, F. / Laguna, M. (1993): Tabu search. in: Reeves, C.R. (ed.); Modern Heuristic Techniques for Combinatorial Problems, (Blackwell) Oxford, 70–150
Klemt, W.D. / Stemme, W. (1988): Schedule synchronization for public transit networks. in: Daduna, J.R. / Wren, A. (eds.); Computer-Aided Transit Scheduling, (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo, 327–335
Krolak, P. / Felts, W. / Marble, G. (1971): A man-machine approach toward solving the traveling salesman problem. in: Communications of the ACM 14, 327–334
Malucelli, F. (1993): Quadratic assignment problems: Solution methods and applications. Ph.D. thesis, Universita di Pisa
Skorin-Kapov, J. (1990): Tabu search applied to the quadratic assignment problem. in: ORSA Journal on Computing 2, 33–45
Stumpf, P. (1993): Synchrpnisierung von Taktfahrplänen in öffentlichen Nahverkehrsnetzen. Diploma thesis, Universität Augsburg
Voß, S. (1992): Network design formulations in schedule synchronization. in: Desrochers, M. / Rousseau, J.-M. (eds.); Computer-aided Transit Scheduling, (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo, 137–152
Voß, S. (1993): Tabu search: Applications and prospects. in: Du, D.-Z./ Pardalos, P. (eds.); Network Optimization Problems, (World Scientific) Singapore, New Jersey, London, Hong Kong, 333–353
Voß, S. (1995): Solving quadratic assignment problems using the reverse elimination method. in: Nash, S.G. / Sofer, A. (eds.): The Impact of Emerging Technologies on Computer Science and Operations Research. (Kluwer) Dordrecht
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daduna, J.R., Voß, S. (1995). Practical Experiences in Schedule Synchronization. In: Daduna, J.R., Branco, I., Paixão, J.M.P. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57762-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-57762-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60193-7
Online ISBN: 978-3-642-57762-8
eBook Packages: Springer Book Archive