Abstract
Real-time dispatch problems arise when preparing and executing the daily schedule of local transport companies. We consider the daily dispatch of transport vehicles like trams in storage yards. Immediately on arrival, each tram has to be assigned to a location in the depot and to an appropriate round trip of the next schedule period. In order to achieve a departure order satisfying the scheduled demand, shunting of vehicles may be unavoidable. Since shunting takes time and causes operational cost, the number of shunting movements should be minimized without violation of operational constraints. As an alternative, we may serve some round trips with trams of type differing from the requested type.
In practice, the actual arrival order of trams may differ substantially from the scheduled arrival order. Then, dispatch decisions are due within a short time interval and have to be based on incomplete information. For such real-time dispatch problems, we develop combinatorial optimization models and exact as well as heuristic algorithms. Computational experience for real-world and random data shows that the derived methods yield good (often optimal) solutions within the required tight time bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
R. Battiti and G. Tecchiolli,The reactive tabu search, ORSA J. Computing 6(2) (1994) 126–140.
BERTA: EDV-gestütztes System zur Betriebseinsatzplanung und-auswertung für Verkehrsbetriebe, Berliner Verkehrsbetriebe (BVG), D-10773 Berlin.
U. Blasum, M.R. Bussieck, W. Hochstättler, H.-H. Scheel and T. Winter, Scheduling trams in the morning, Mathematical Methods of Operations Research 49(1) (1999) 137–148.
M.R. Bussieck, T. Winter and U.T. Zimmermann, Discrete optimization in public rail transport, Mathematical Programming 79(1–3) (1997) 415–444.
E. Çela, The Quadratic Assignment Problem. Theory and Algorithms(Kluwer Academic, Dordrecht, 1998).
A. Fiat and G.J. Woeginger, Online Algorithms-The State of the Art, Lecture Notes in Computer Science 1442 (Springer, 1998).
M.R. Garey and D.S. Johnson, Computers and Intractability-A Guide to the Theory of NPCompleteness(W.H. Freeman, 1979).
W. Henning and C. Schmidt, Stadtwerke Bielefeld: Betriebshofsteuerung für die Erweiterung des Betriebshofes in Bielefeld-Sieker, Verkehr und Technik 9 (1997) 391–396.
L. Kaufmann and F. Broeckx, An algorithm for the quadratic assignment problem, European Journal on Operational Research 2 (1978) 204–211.
Microbus: Betriebs-und Einsatzplanung, IVU Traffic Technologies AG, Bundesallee 88, D-12161 Berlin.
W. Naumann, A. Winkler, A. Putzer and E. Krüger, Fahrzeugdispositions-und Managementsystem auf dem Betriebshof Rosengarten der Halleschen Verkehrs-AG (HAVAG), Verkehr und Technik 4 (1998) 111–118.
E. Schiller, A. Winkler, H. Schmäling and U. Leonhardt, Rechnergestützte Technologien für die Steuerung des Fahrzeugeinsatzes auf dem neuen Betriebshof Adelsberg der Chemnitzer Verkehrs-Aktiengesellschaft, Verkehr und Technik 4 (1997) 161–166.
S. S´eguin, J.-Y. Potvin, M. Gendreau, T.G. Crainic and P. Marcotte, Real-time decision problems: An operational research perspective, Journal of the Operational Research Society 48 (1997) 162–174.
T. Winter, Online and real-time dispatching problems, Ph.D. thesis, TU Braunschweig (1999).
T. Winter and U.T. Zimmermann, Discrete online and real-time optimization, in: Proceedings of the 15th IFIP World Computer Congress, Budapest/ Vienna (1998).
Rights and permissions
About this article
Cite this article
Winter, T., Zimmermann, U.T. Real-time dispatch of trams in storage yards. Annals of Operations Research 96, 287–315 (2000). https://doi.org/10.1023/A:1018907720194
Issue Date:
DOI: https://doi.org/10.1023/A:1018907720194