ISBN 978-3-8439-4899-9

978-3-8439-4899-9, Reihe Mathematik

Nicolas Fröhlich
Facility Location Planning and Network Interdiction

179 Seiten, Dissertation Technische Universität Kaiserslautern (2021), Hardcover, A5

Zusammenfassung / Abstract

Facility location planning is of great importance in numerous applications of operational research. It is therefore important that established locations are protected against failures of the infrastructure and targeted perturbations. Better yet, they are selected such that potential disruptions have as little impact as possible on the quality of the chosen facilities. Network interdiction problems deal with the detection of such worst-case scenarios. The goal of network interdiction is to identify the worst possible outcome for the decision maker that can be achieved by predefined means. In this thesis, the theoretical concept of network interdiction is applied to combinatorial facility location models. We present a thorough complexity analysis and investigate exact solution algorithms for selected problems of this framework.

The further course of this thesis addresses enhancements of classical location models and new modeling approaches. Instead of the coverage of the nodes, optimal locations are sought to cover the edges in the network. Besides the theoretical investigation of this modified problem, an approximation algorithm is developed and tested in a computational study. Finally, a shortest path problem and a location problem based on ordinal criteria are introduced. Solutions are evaluated by means of a vector of qualitative entries that cannot be numerically offset. According to a novel definition of dominance, algorithmic procedures for computing ordinally efficient solutions are developed and the number of efficient solutions and non-dominated images is investigated.