| Summary: | This thesis deals with an investigation of combinatorial and robust optimisation models
to solve railway problems.
Railway applications represent a challenging area for operations research. In fact, most problems in this context can be modelled as combinatorial optimisation problems, in which the number of feasible solutions is finite. Yet, despite the astonishing success in the field of combinatorial optimisation, the current state of algorithmic research faces severe difficulties with highly-complex and data-intensive applications such as those dealing with optimisation issues in large-scale transportation networks.
One of the main issues concerns imperfect information. The idea of Robust Optimisation, as a way
to represent and handle mathematically systems with not precisely known data, dates back to 1970s.
Unfortunately, none of those techniques proved to be successfully applicable in one of the most complex and largest in scale (transportation) settings: that of railway systems. Railway optimisation deals with planning and scheduling problems over several time horizons. Disturbances are inevitable and severely affect the planning
process. Here we focus on two compelling aspects of planning: robust planning and online (real-time) planning.
|
|---|
