ИСТИНА

We have a double-track railroad with several single-track lines (some tracks are closed due to technical reasons). It is assumed that some maintenance works are performed during the planning horizon. The optimal train schedule, when every track is opened, is known. The objective is to find the train schedule for a new railroad with minimum deviations from the inital schedule for a railroad with opened tracks. We solve this problem as an integer programming problem. In the case when the railway is closed in one direction we suggest using the method of successive batching.