In this paper, we propose a Benders' decomposition algorithm to tackle the real-time railway traffic management problem. Specifically, we decompose the mixed-integer linear programming formulation at the basis of RECIFE-MILP (Pellegrini et al., 2015), a state-of-the-art algorithm for this problem. In our Benders' decomposition, we minimize total delays by making train routing and scheduling decisions in the master problem. Given these decisions, we compute the trains arrival and passing times in the slave problem to deduce the total delay. By applying our Benders' decomposition algorithm to RECIFE-MILP, we tackle large instances representing traffic in the Rouen-Rive-Droite control area, in France.