Online Optimization: Probabilistic Analysis and Algorithm Engineering

Abstract

This article gives an overview on some of the results of the authors’ PhD thesis [3]. The subject of this thesis is online optimization, which deals with making decisions in an environment where the data describing the process to optimize becomes available over time, i. e., online. In particular, we study algorithms for combinatorial online optimization problems involving discrete decisions both from a practical and a theoretical point of view. Here we sketch our results related to the control of elevators in high-rise buildings.

Supported by the DFG research group “Algorithms, Structure, Randomness” (Grant number GR 883/10-3, GR 883/10-4) and a DAAD dissertation grant.