Learn More
In this paper the problem of eeciently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We consider two versions of the problem. In the rst one the server(More)
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(More)
In this paper we consider the on-line version of the routing problem with release times. Formally, it consists in a metric space M with a distinguished point o (the origin), plus a sequence of triples < ti; pi; ri > where pi is a point of M , ri speciies the rst moment in which the request is ready to be served, and ti represents the moment in which the(More)