@inproceedings{BorndoerferLoebelLoebeletal.2024, author = {Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and L{\"o}bel, Fabian and Weider, Steffen}, title = {Solving the Electric Bus Scheduling Problem by an Integrated Flow and Set Partitioning Approach}, volume = {123}, booktitle = {24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, doi = {10.4230/OASIcs.ATMOS.2024.11}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-211992}, pages = {11:1 -- 11:16}, year = {2024}, abstract = {Attractive and cost-efficient public transport requires solving computationally difficult optimization problems from network design to crew rostering. While great progress has been made in many areas, new requirements to handle increasingly complex constraints are constantly coming up. One such challenge is a new type of resource constraints that are used to deal with the state-of-charge of battery-electric vehicles, which have limited driving ranges and need to be recharged in-service. Resource constrained vehicle scheduling problems can classically be modelled in terms of either a resource constrained (multi-commodity) flow problem or in terms of a path-based set partition problem. We demonstrate how a novel integrated version of both formulations can be leveraged to solve resource constrained vehicle scheduling with replenishment in general and the electric bus scheduling problem in particular by Lagrangian relaxation and the proximal bundle method.}, language = {en} } @article{LangenhanBorndoerferLoebeletal.2012, author = {Langenhan, Andreas and Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and Schulz, Christof and Weider, Steffen}, title = {Duty Scheduling Templates}, journal = {Proceedings of Conference on Advanced Systems for Public Transport 2012 (CASPT12)}, editor = {Mu{\~n}oz, J. C. and Voß, S.}, year = {2012}, abstract = {We propose duty templates as a novel concept to produce similar duty schedules for similar days of operation in public transit. Duty templates can conveniently handle various types of similarity requirements, and they can be implemented with ease using standard algorithmic techniques. They have produced good results in practice.}, language = {en} } @misc{BorndoerferLangenhanLoebeletal.2012, author = {Bornd{\"o}rfer, Ralf and Langenhan, Andreas and L{\"o}bel, Andreas and Schulz, Christof and Weider, Steffen}, title = {Duty Scheduling Templates}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14699}, number = {12-09}, year = {2012}, abstract = {We propose duty templates as a novel concept to produce similar duty schedules for similar days of operation in public transit. Duty templates can conveniently handle various types of similarity requirements, and they can be implemented with ease using standard algorithmic techniques. They have produced good results in practice.}, language = {en} } @misc{BorndoerferGroetschelLoebel2000, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and L{\"o}bel, Andreas}, title = {Der schnellste Weg zum Ziel}, journal = {Alles Mathematik}, editor = {Aigner, Martin and Behrends, Ehrhard}, publisher = {Vieweg Verlag}, address = {Braunschweig/Wiesbaden}, doi = {10.1007/978-3-322-96366-6_5}, pages = {45 -- 76}, year = {2000}, language = {en} } @misc{BorndoerferLoebelStrubbeetal.1998, author = {Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and Strubbe, Uwe and V{\"o}lker, Manfred}, title = {Zielorientierte Dienstplanoptimierung}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3847}, number = {SC-98-41}, year = {1998}, abstract = {Dieser Artikel behandelt einen Ansatz zur zielorientierten Optimierung der Dienstplanung im {\"O}PNV. Der Ansatz zielt auf die vollst{\"a}ndige Ausnutzung aller planerischen Freiheitsgrade unter korrekter Ber{\"u}cksichtigung von gesetzlichen, tariflichen, technischen und betrieblichen Rahmenbedingungen. Er basiert auf mathematischen Optimierungstechniken, die wir gegenw{\"a}rtig in einem vom Bundesministerium f{\"u}r Bildung und Forschung ({\tt bmb+f}) gef{\"o}rderten Verbundprojekt in einer Kooperation zwischen der HanseCom GmbH, der IVU GmbH und dem Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin entwickeln. Es ist geplant, das Verfahren in die Softwareprodukte HOT II, MICROBUS II und OPUS zu integrieren. Verhandlungen mit den Berliner Verkehrsbetrieben {\"u}ber eine Projektbeteiligung und Integration unserer Software in BERTA sind zur Zeit im Gang. Wir beschreiben die Methodik des Ansatzes, diskutieren Aspekte seiner praktischen Verwendung, und wir berichten {\"u}ber den Stand der Entwicklung.}, language = {de} } @misc{BorndoerferGroetschelLoebel1998, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and L{\"o}bel, Andreas}, title = {Optimization of Transportation Systems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3529}, number = {SC-98-09}, year = {1998}, abstract = {The world has experienced two hundred years of unprecedented advances in vehicle technology, transport system development, and traffic network extension. Technical progress continues but seems to have reached some limits. Congestion, pollution, and increasing costs have created, in some parts of the world, a climate of hostility against transportation technology. Mobility, however, is still increasing. What can be done? There is no panacea. Interdisciplinary cooperation is necessary, and we are going to argue in this paper that {\em Mathematics\/} can contribute significantly to the solution of some of the problems. We propose to employ methods developed in the {\em Theory of Optimization\/} to make better use of resources and existing technology. One way of optimization is better planning. We will point out that {\em Discrete Mathematics\/} provides a suitable framework for planning decisions within transportation systems. The mathematical approach leads to a better understanding of problems. Precise and quantitative models, and advanced mathematical tools allow for provable and reproducible conclusions. Modern computing equipment is suited to put such methods into practice. At present, mathematical methods contribute, in particular, to the solution of various problems of {\em operational planning}. We report about encouraging {\em results\/} achieved so far.}, language = {en} } @misc{BorndoerferLoebelWeider2004, author = {Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and Weider, Steffen}, title = {A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7898}, number = {04-14}, year = {2004}, abstract = {This article proposes a Lagrangean relaxation approach to solve integrated duty and vehicle scheduling problems arising in public transport. The approach is based on the proximal bundle method for the solution of concave decomposable functions, which is adapted for the approximate evaluation of the vehicle and duty scheduling components. The primal and dual information generated by the bundle method is used to guide a branch-and-bound type algorithm. Computational results for large-scale real-world integrated vehicle and duty scheduling problems with up to 1,500 timetabled trips are reported. Compared with the results of a classical sequential approach and with reference solutions, integrated scheduling offers remarkable potentials in savings and drivers' satisfaction.}, language = {en} } @misc{BorndoerferGroetschelLoebel2001, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and L{\"o}bel, Andreas}, title = {Duty Scheduling in Public Transit}, doi = {10.1007/978-3-642-55753-8_50}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6286}, number = {01-02}, year = {2001}, abstract = {This article is about \emph{adaptive column generation techniques} for the solution of duty scheduling problems in public transit. The current optimization status is exploited in an adaptive approach to guide the subroutines for duty generation, LP resolution, and schedule construction toward relevant parts of a large problem. Computational results for three European scenarios are reported.}, language = {en} } @misc{BorndoerferLoebelWeider2002, author = {Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and Weider, Steffen}, title = {Integrierte Umlauf- und Dienstplanung im {\"O}ffentlichen Nahverkehr}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6773}, number = {02-10}, year = {2002}, abstract = {Wir beschreiben einen Ansatz zur integrierten Umlauf- und Dienstplanung im {\"o}ffentlichen Nahverkehr. Der Ansatz zielt auf die Verbesserung des Gesamtwirkungsgrades dieser beiden Planungsschritte und auf die besondere Planungsproblematik im Regionalverkehr. Wir entwickeln dazu mathematische Optimierungstechniken f{\"u}r den Einsatz in den Planungssystemen MICROBUS II und DIVA.}, language = {de} } @misc{GroetschelBorndoerferLoebel2003, author = {Gr{\"o}tschel, Martin and Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas}, title = {Duty Scheduling in Public Transit}, journal = {MATHEMATICS - Key Technology for the Future}, editor = {J{\"a}ger, Willi and Krebs, Hans-Joachim}, publisher = {Springer}, doi = {10.1007/978-3-642-55753-8_50}, pages = {653 -- 674}, year = {2003}, language = {en} } @incollection{BorndoerferGroetschelLoebel1998, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and L{\"o}bel, Andreas}, title = {Alcuin's Transportation Problems and Integer Programming}, volume = {2}, booktitle = {Charlemagne and his Heritage. 1200 Years of Civilization and Science in Europe. Karl der Grosse und sein Nachwirken . 1200 Jahre Kultur und Wissenschaft in Europa}, editor = {Butzer, Paul Leo and Jongen, Hubertus and Oberschelp, Walter}, publisher = {Brepols Publisher}, address = {Turnhout}, pages = {379 -- 409}, year = {1998}, language = {en} }