In this paper the problem of eeciently serving a sequence of requests that are presented in a metric space in an on-line fashion and then returning back to the departure point is considered. The problem, that is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and that for the sake of intuition we call On-Line Traveling ...
