Maintenance optimization for railway infrastructure networks

Maintenance is crucial for the proper functioning and lifetime extension of a railway infrastructure network, which is composed of various infrastructures with different functions. In this thesis we develop robust and tractable model-based approaches for maintenance optimization of railway infrastructure networks. In addition, we develop a compact formulation for a variant of the multiple Traveling Salesman Problem (TSP), that can be applied to optimal scheduling of maintenance crews for a railway network, and a systematic numerical solution method for reverse Stackelberg game with incomplete information, which can be viewed as the framework for optimal maintenance contract design.