Simulation in train traffic rescheduling is strongly characterized by its dynamic, ever changing nature. For the optimization of train traffic rescheduling, modifications such as reallocation of resources are required during the run-time of simulation. For this reason, different simulation strategies may cause different propagation of delays, and of course, different results of rescheduling. Therefore, an efficient rescheduling requires a simulation procedure to be able to adapt well to different rescheduling strategies for various purposes. Although several simulation models have been proposed in the past, they have not obtained a satisfactory solution in this aspect. This paper presents a method with which multiple rescheduling strategies could be adapted well at different stages. The adaptability and efficiency of the algorithm on overall performance has been examined by experiments. The results of experiments also show that it can get the execution time at the same level with the previous network-based simulation method.