@inproceedings{HillerKlugTuchscherer2009, author = {Hiller, Benjamin and Klug, Torsten and Tuchscherer, Andreas}, title = {Improving the performance of elevator systems using exact reoptimization algorithms}, booktitle = {Proceedings of MAPSP}, pages = {224 -- 226}, year = {2009}, language = {en} } @inproceedings{HillerKlugTuchscherer2010, author = {Hiller, Benjamin and Klug, Torsten and Tuchscherer, Andreas}, title = {Improved destination call elevator control algorithms for up peak traffic}, booktitle = {Operations Research Proceedings 2010}, publisher = {Springer}, year = {2010}, language = {en} } @inproceedings{HeinzKrumkeMegowetal.2006, author = {Heinz, Stefan and Krumke, Sven and Megow, Nicole and Rambau, J{\"o}rg and Tuchscherer, Andreas and Vredeveld, Tjark}, title = {The Online Target Date Assignment Problem}, volume = {3879}, booktitle = {Proc. 3rd Workshop on Approximation and Online Algorithms}, editor = {Erlebach, Thomas and Persiano, Giuseppe}, publisher = {Springer}, pages = {230 -- 243}, year = {2006}, language = {en} } @inproceedings{HillerTuchscherer2008, author = {Hiller, Benjamin and Tuchscherer, Andreas}, title = {Real-Time Destination-Call Elevator Group Control on Embedded Microcontrollers}, booktitle = {Operations Research Proceedings}, editor = {Kalcsics, J{\"o}rg and Nickel, Stefan}, publisher = {Springer}, pages = {357 -- 362}, year = {2008}, language = {en} } @inproceedings{HillerKrumkeSalibaetal.2009, author = {Hiller, Benjamin and Krumke, Sven and Saliba, Sleman and Tuchscherer, Andreas}, title = {Randomized Online Algorithms for Dynamic Multi-Period Routing Problems}, booktitle = {Proceedings of MAPSP}, pages = {71 -- 73}, year = {2009}, language = {en} } @article{HeinzKaibelPeinhardtetal.2006, author = {Heinz, Stefan and Kaibel, Volker and Peinhardt, Matthias and Rambau, J{\"o}rg and Tuchscherer, Andreas}, title = {LP-Based Local Approximation for Markov Decision Problems}, number = {343}, publisher = {Matheon}, year = {2006}, language = {en} } @inproceedings{Tuchscherer2004, author = {Tuchscherer, Andreas}, title = {Dynamical configuration of transparent optical telecommunication networks}, booktitle = {Operations Research Proceedings}, editor = {Fleuren, Hein and den Hertog, Dick and Kort, Peter}, publisher = {Springer}, pages = {25 -- 32}, year = {2004}, language = {en} } @inproceedings{HuelsermannJaegerPoensgenetal.2003, author = {H{\"u}lsermann, Ralf and J{\"a}ger, Monika and Poensgen, Diana and Krumke, Sven and Rambau, J{\"o}rg and Tuchscherer, Andreas}, title = {Dynamic routing algorithms in transparent optical networks}, booktitle = {Proceedings of the 7th IFIP Working Conference on Optical Network Design \& Modelling (ONDM 2003)}, editor = {Cinkler, Tibor and Jakab, Tivadar and Tapolcai, J{\`a}nos and G{\`a}sp{\`a}r, Csaba}, publisher = {Kluwer Academic Press}, pages = {293 -- 312}, year = {2003}, language = {en} } @misc{AchterbergKochTuchscherer2008, author = {Achterberg, Tobias and Koch, Thorsten and Tuchscherer, Andreas}, title = {On the Effects of Minor Changes in Model Formulations}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10808}, number = {08-29}, year = {2008}, abstract = {Starting with the description of the Traveling Salesmen Problem formulation as given by van Vyve and Wolsey in the article Approximate extended formulations'', we investigate the effects of small variations onto the performance of contemporary mixed integer programming solvers. We will show that even minor changes in the formulation of the model can result in performance difference of more than a factor of 1000. As the results show it is not obvious which changes will result in performance improvements and which not.}, language = {en} } @misc{HillerTuchscherer2007, author = {Hiller, Benjamin and Tuchscherer, Andreas}, title = {Real-Time Destination-Call Elevator Group Control on Embedded Microcontrollers}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10108}, number = {07-26}, year = {2007}, abstract = {Algorithmic control of elevator systems has been studied for a long time. More recently, a new paradigm for elevator control has emerged. In destination call systems, the passenger specifies not only the direction of his ride, but the destination floor. Such a destination call system is very interesting from an optimization point of view, since more information is available earlier, which should allow improved planning. However, the real-world destination call system envisioned by our industry partner requires that each destination call (i.e. passenger) is assigned to a serving elevator immediately. This early assignment restricts the potential gained from the destination information. Another aspect is that there is no way to specify the destination floor in the cabin. Therefore, the elevator has to stop on every destination floor of an assigned call, although the passenger may not have boarded the cabin, e.g. due to insufficient capacity. In this paper we introduce a new destination call control algorithm suited to this setting. Since the control algorithm for an entire elevator group has to run on embedded microprocessors, computing resources are very scarce. Since exact optimization is not feasible on such hardware, the algorithm is an insertion heuristic using a non-trivial data structure to maintain a set of tours. To assess the performance of our algorithm, we compare it to similar and more powerful algorithms by simulation. We also compare to algorithms for a conventional system and with a more idealized destination call system. This gives an indication of the relative potentials of these systems. In particular, we assess how the above real-world restrictions influence performance. The algorithm introduced has been implemented by our industry partner for real-world use.}, language = {en} }