Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
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 request’s disclosure date, the time when a city’s 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631 · cited 2×
“Karlin, Manasse, Rudolph, Sleator [14] introduced the notion of a competitive ratio.”
Background
Cited by
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
A unified framework for stochastic optimization
Powell, W. B. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.014 · Cited by 314
Hyland, M., & Mahmassani, H. S. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.05.003 · Cited by 286
Dandl, F., Hyland, M., Bogenberger, K., & Mahmassani, H. S. (2019) · Transportation · doi:10.1007/s11116-019-10007-9 · Cited by 74
Hyland, M. F., & Mahmassani, H. S. (2017) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2653-04 · Cited by 69
Metadata
- Authors
- Jaillet, P., & Wagner, M. R.
- Venue
- Transportation Science
- Published
- 2006-05
- Volume
- 40
- Issue
- 2
- Pages
- 200-210
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2162228023
- Cited by
- 102
- References
- 1
- FWCI
- 8.55
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios. https://app.cochat.ai/papers/10.1287/trsc.1060.0147
- The paper
- Jaillet, P., & Wagner, M. R. (2006). Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios. Transportation Science. https://doi.org/10.1287/trsc.1060.0147
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.