Citation

Lake M, Ferreira L. Transp. Traffic Theory 2002; 15: 63-74.

Copyright

(Copyright © 2002, Publisher varies)

DOI

unavailable

PMID

unavailable

Abstract

A method aimed at reducing the conflict between trains and track maintenance by short term scheduling of maintenance and required resources is presented in this paper. The risk of delays to the trains and maintenance is incorporated in the process of developing the maintenance timetable. The paper formulates the problem as a binary integer non-linear programming problem by applying the following heuristic techniques: 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 in the paper is found to be the simulated annealing. Sensitivity analysis is conducted to examine the effects of variation in the input parameters, such as different priorities for the railway company.