The Time-Dependent Traveling Salesman Problem (TDTSP) is the extended version of the TSP where arc costs depend on the time when the arc is traveled. When we consider urban deliveries, travel times vary considerably during the day and optimizing a delivery tour comes down to solving an instance of the TDTSP. In this paper we present a global constraint, extended from the no-overlap constraint, that integrates time-dependent transition costs and we compare the performance of CP models for the TDTSP with and without the new constraint.