Solving Network Design Problems via Decomposition, Aggregation and Approximation

1. Auflage 2016
ISBN: 978-3-658-13912-4
Verlag: Springer

Buch, Englisch, 203 Seiten, Format (B × H): 168 mm x 240 mm, Gewicht: 3765 g

Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time.

Zielgruppe

Research

Autoren/Hrsg.

Bärmann, Andreas

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Optimierung

Inhaltsverzeichnis

Decomposition for Multi-Period Network Design.- Solving Network Design Problems via Aggregation.- Approximate Second-Order Cone Robust Optimization.

Über Autor(innen)

Dr. Andreas Bärmann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research is focussed on mathematical optimization, especially the optimization of logistic processes.