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.
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
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
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Dueck, G. (1993) · Journal of Computational Physics · doi:10.1006/jcph.1993.1010 · Cited by 765
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.06.044 · Cited by 726
Dynamic vehicle routing problems: Three decades and counting
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016) · Networks · doi:10.1002/net.21628 · Cited by 709
The Traveling-Salesman Problem
Flood, M. M. (1956) · Operations Research · doi:10.1287/opre.4.1.61 · Cited by 682
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Self-citationExploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E., & Pape, C. L. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0518-7 · Cited by 530
The bi-objective Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.08.002 · Cited by 460
A unified solution framework for multi-attribute vehicle routing problems
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.045 · Cited by 433
Record Breaking Optimization Results Using the Ruin and Recreate Principle
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000) · Journal of Computational Physics · doi:10.1006/jcph.1999.6413 · Cited by 413
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Bent, R., & Van Hentenryck, P. (2004) · Transportation Science · doi:10.1287/trsc.1030.0049 · Cited by 355
Nurse scheduling with tabu search and strategic oscillation
Dowsland, K. A. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00281-6 · Cited by 347
1. An Overview of Vehicle Routing Problems
Toth, P., & Vigo, D. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515.ch1 · Cited by 343
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
Bent, R. W., & Hentenryck, P. V. (2004) · Computers & Operations Research · doi:10.1016/j.cor.2004.08.001 · Cited by 276
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Glover, F. (1996) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)00037-e · Cited by 265
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
Masson, R., Lehuédé, F., & Péton, O. (2012) · Transportation Science · doi:10.1287/trsc.1120.0432 · Cited by 262
An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem
Wen, M., Linde, E., Ropke, S., Mirchandani, P., & Larsen, A. (2016) · Computers & Operations Research · doi:10.1016/j.cor.2016.06.013 · Cited by 236
Self-citationA brief history of linear and mixed-integer programming computation
Bixby, R. E. (2012) · Documenta Mathematica Series · doi:10.4171/dms/6/16 · Cited by 228
An adaptive VNS algorithm for vehicle routing problems with intermediate stops
Schneider, M., Stenger, A., & Hof, J. (2014) · OR Spectrum · doi:10.1007/s00291-014-0376-5 · Cited by 162
Iris, Ç., Pacino, D., & Røpke, S. (2017) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2017.06.013 · Cited by 154
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001) · Mathematical Programming · doi:10.1007/s101070100234 · Cited by 145
The capacitated vehicle routing problem with stochastic demands and time windows
Lei, H., Laporte, G., & Guo, B. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.02.007 · Cited by 144
LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search
Palpant, M., Artigues, C., & Michelon, P. Y. P. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000039521.26237.62 · Cited by 137
Belo-Filho, M. A. F., Amorim, P., & Almada‐Lobo, B. (2015) · International Journal of Production Research · doi:10.1080/00207543.2015.1010744 · Cited by 134
A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic
Santini, A., Røpke, S., & Hvattum, L. M. (2018) · Journal of Heuristics · doi:10.1007/s10732-018-9377-x · Cited by 118
Prescott‐Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (2009) · Networks · doi:10.1002/net.20332 · Cited by 114
Utilizing individual picker skills to improve order batching in a warehouse
Matusiak, M., de Koster, R. B. M., & Saarinen, J. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.05.002 · Cited by 108
Creating very large scale neighborhoods out of smaller ones by compounding moves
Ergün, Ö., Orlin, J. B., & Steele-Feldman, A. (2006) · Journal of Heuristics · doi:10.1007/s10732-006-5561-5 · Cited by 78
Carrizosa, E., Guerrero, V., & Morales, D. R. (2016) · Computers & Operations Research · doi:10.1016/j.cor.2016.09.018 · Cited by 13
The consultation timetabling problem at Danish high schools
Kristiansen, S., Sørensen, M., Herold, M. B., & Stidsen, T. (2013) · Journal of Heuristics · doi:10.1007/s10732-013-9219-9 · Cited by 7
Elective course student sectioning at Danish high schools
Kristiansen, S., & Stidsen, T. (2014) · Annals of Operations Research · doi:10.1007/s10479-014-1593-7 · Cited by 4
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
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Self-citationAn adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
Sacramento, D., Pisinger, D., & Ropke, S. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.02.018 · Cited by 563
Self-citationHeuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
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
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
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.