Amortized efficiency of list update and paging rules
Communications of the ACM
Routing and scheduling on a shoreline with release times
Management Science
Constructing competitive tours from local information
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Online computation and competitive analysis
Online computation and competitive analysis
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
On-line single-server dial-a-ride problems
Theoretical Computer Science
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
The Online TSP Against Fair Adversaries
INFORMS Journal on Computing
Approximation Algorithms for Orienteering and Discounted-Reward TSP
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
Operations Research Letters
Online traveling salesman problem with deadline and advanced information
Computers and Industrial Engineering
How much is it worth to know the future in online conversion problems?
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider online versions of the traveling salesman problem (TSP) and traveling repairman problem (TRP) where instances are not known in advance. Cities (points) to be visited are revealed over time, while the server is en route serving previously released requests. These problems are known in the literature as the online TSP (TRP, respectively). The corresponding offline problems are the TSP (TRP) with release dates, problems where each point has to be visited at or after a given release date. In the current literature, the assumption is that a request becomes known at the time of its release date. In this paper we introduce the notion of a requests disclosure date, the time when a citys location and release date are revealed to the server. In a variety of disclosure date scenarios and metric spaces, we give new online algorithms and quantify the value of this advanced information in the form of improved competitive ratios. We also provide a general result on polynomial-time online algorithms for the online TSP.