@TECHREPORT\{IMM2006-05095,
    author       = "J. J. Groth and J. Clausen and J. Larsen",
    title        = "Optimal Reinsertion of Cancelled Train Line",
    year         = "2006",
    month        = "aug",
    keywords     = "Operations Research, Disruption, Recovery, Real-time, Mixed Integer Programming model",
    number       = "",
    series       = "",
    institution  = "",
    address      = "",
    type         = "",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/5095-full.html",
    abstract     = "{DSB} {S-}tog (S-tog) is the operator of the suburban rail of
Copenhagen, Denmark. The suburban network covers approximately 170
km of double-track and 80 stations. When larger disturbances occur
in the {S-}tog network an often used countermeasure is to take out
entire train lines. The problem is to decide when the reinsertion
shall start on each rolling stock depot as we would like to get
back to regular service asap. It is however a complex task to
calculate a reinsertion of train lines. Here we present a mixed
integer programming (MIP) model for finding a reinsertion plan of
a train line minimizing the latest time to finish reinsertion. The
solution should maintain some properties w.r.t. the order in which
the trains are inserted within a depot and between depots. The {MIP} 
model has been implemented in gams and solved with Cplex. The
optimal solution is found within an average of 0.5 {CPU} seconds in
each test case. Reinsertion schemes in operation is today
calculated by the reinsertion model."
}