The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Iterated local search for the team orienteering problem with time windows
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
Variable neighborhood search: Principles and applications
Hansen, P., & Mladenović, N. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00100-4 · Cited by 1,902
Lourenço, H. R., Martin, O. C., & Stützle, T. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_11 · Cited by 1,164
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997) · Networks · doi:10.1002/(sici)1097-0037(199709)30:2<105::aid-net5>3.0.co;2-g · Cited by 864
Traveling Salesman Problems with Profits
Feillet, D., Dejax, P. J., & Michel Gendreau, A. (2005) · Transportation Science · doi:10.1287/trsc.1030.0079 · Cited by 622
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Righini, G., & Salani, M. (2008) · Networks · doi:10.1002/net.20212 · Cited by 284
A TABU search heuristic for the team orienteering problem
Tang, H., & Miller-Hooks, E. D. (2003) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.008 · Cited by 283
Metaheuristics for the team orienteering problem
Archetti, C., Hertz, A., & Speranza, M. G. (2006) · Journal of Heuristics · doi:10.1007/s10732-006-9004-0 · Cited by 248
Cited by
Peng, G., Dewil, R., Verbeeck, C., Gunawan, A., Xing, L., & Vansteenwegen, P. (2019) · Computers & Operations Research · doi:10.1016/j.cor.2019.05.030 · Cited by 113
Self-citation
Metadata
- Authors
- Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2009-12
- Volume
- 36
- Issue
- 12
- Pages
- 3281-3290
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2075600171
- Cited by
- 353
- References
- 13
- FWCI
- 34.49
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Iterated local search for the team orienteering problem with time windows. https://app.cochat.ai/papers/10.1016/j.cor.2009.03.008
- The paper
- Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2009). Iterated local search for the team orienteering problem with time windows. Computers & Operations Research. https://doi.org/10.1016/j.cor.2009.03.008
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.
