Maintenance optimization for railway infrastructure networks

More Info
expand_more
Publication Year
2018
Language
English
ISBN (print)
978-90-5584-238-4
Downloads counter
298
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

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.

Files

Thesis.pdf
(pdf | 2.53 Mb)
License info not available