On the tactical and operational train routing selection problem

•We deal with the problem of selecting a subset of routing alternatives for each train.•We investigate when it is the best moment to perform the routing selection.•The trade-off between abundant computation time and updated information is tackled.•The problem is solved using two variants of an Ant Colony Optimization algorithm.•The best approach depends on the predictability of the perturbation considered.