This paper presents a method aimed at reducing the conflict between the trains and track maintenance by the short-term scheduling of the maintenance and the required resources. The risk of delays to the trains and maintenance is incorporated in the process of developing the maintenance timetable. The problem is formulated as a binary integer non-linear programming problem, with the following heuristics techniques applied: Simulated Annealing; Local Search; Multiple Local Search; and Tabu Search. The most appropriate solution method to solve the short-term maintenance scheduling problem as formulated here is found to be Simulated Annealing. Sensitivity analysis is conducted to examine the effects of variation in the input parameters, such as different priorities for the railway company. (Author/publisher) For the covering entry of this conference, please see ITRD abstract No. E208120.
Samenvatting