A branch-and-bound algorithm for the time-Dependent rural postman problem

This paper deals with the time-dependent version of the classical Rural Postman Problem in which arc traversal times vary along the planning horizon. The relationship with the time-invariant counterpart is investigated and a branch-and-bound algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.