Resolving infeasibilities in the PESP model of the Dutch railway timetabling problem

Many times the railway timetabling problem is infeasible. This means a set of constraints can not be satisfied at the same time. It is hard to solve this by hand. This thesis proposed two algorithm to resolve the infeasibilities and to come up with a timetable. It serves as an extention to the CADANS solver.

Finding the optimal set of parking locations for maintenance trains in the Dutch railway network: An optimisation approach using a combination of discrete-event simulation and simulated annealing

The Dutch railway system is subject to maintenance, which is carried out by a group of rail contractors who need parking space to park and prepare trains in between projects. The objective of this study is to minimise the total costs as a result of the distance travelled by maintenance trains and the preservation of the included parking...

Railway - Spare Inventory & Maintenance Scheduling model development

To better govern inventory control of spare parts in tandem with scheduling of maintenance operations in a railway setting, a Railway Spare Inventory & Maintenance Scheduling (R-SIMS) model is developed. To suit the railway industry setting the model includes an inventory control strategy which envokes continuous monitoring and a reorder...