Das Partial Set Covering Problem und Erweiterungen : Modellierung und Lösungsverfahren
In this thesis, we study the Partial Set Covering Problem (PSCP) as well as some new extensions of the PSCP. We present a new extension of the PSCP which is called the Multiple Coverage Partial Set Covering Problem (MCPSCP). The model combines the aspect of multiple coverage with the PSCP. Heuristic and approximative algorithms are proposed. Here, the focus lies on the PSCP and the MCPSCP for which several local search and Langrangean-based algorithms are presented. The heuristics are tested on a wide variety of benchmark problems. Furthermore, we report about an application of the PSCP and the MCPSCP in railway networks. The models are used to find optimal positions for vehicle testing stations.
Share and cite
Could not load citation form. Default citation form is displayed.