The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Large Neighborhood Search
Overview
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
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Self-citationVariable 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
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
The Shifting Bottleneck Procedure for Job Shop Scheduling
Adams, J., Balas, E., & Zawack, D. J. (1988) · Management Science · doi:10.1287/mnsc.34.3.391 · Cited by 1,603
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
Self-citationUsing Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
A review of dynamic vehicle routing problems
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.08.015 · Cited by 1,253
Cited by
Partial recharge strategies for the electric vehicle routing problem with time windows
Keskin, M., & Çatay, B. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.01.013 · Cited by 600
Song, Y., Ou, J., Pedrycz, W., Suganthan, P. N., Wang, X., Xing, L., & Zhang, Y. (2024) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2023.3345928 · Cited by 63
DRL-Based Dynamic Destroy Approaches for Agile-Satellite Mission Planning
Huang, W., Li, Z., He, X., Xiang, J., Du, X., & Liang, X. (2023) · Remote Sensing · doi:10.3390/rs15184503 · Cited by 11
Metadata
- Authors
- Pisinger, D., & Ropke, S.
- Venue
- International Series in Operations Research & Management Science
- Publisher
- Springer International Publishing
- Published
- 2018-09-21
- Pages
- 99-127
- ISSN
- 0884-8289 (ISSN-L)
- 2214-7934
- OpenAlex
- W90049316
- Cited by
- 395
- References
- 42
- FWCI
- 61.46
- Type
- book chapter
- 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: Large Neighborhood Search. https://app.cochat.ai/papers/10.1007/978-3-319-91086-4_4
- The paper
- Pisinger, D., & Ropke, S. (2019). Large Neighborhood Search. International Series in Operations Research & Management Science. https://doi.org/10.1007/978-3-319-91086-4_4
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.
