The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A user's guide to tabu 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
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Self-citationGlover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Self-citationFuture paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Self-citationAn 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
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Glover, F. (1977) · Decision Sciences · doi:10.1111/j.1540-5915.1977.tb01074.x · Cited by 1,363
Self-citationA Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
The Quadratic Assignment Problem
Lawler, E. L. (1963) · Management Science · doi:10.1287/mnsc.9.4.586 · Cited by 964
Some efficient heuristic methods for the flow shop sequencing problem
Taillard, É. D. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90090-x · Cited by 869
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
Cited by
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Parallelism and evolutionary algorithms
Alba, E., & Tomassini, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800880 · Cited by 823
Review: Multi-objective optimization methods and application in energy saving
Cui, Y., Geng, Z., Zhu, Q., & Han, Y. (2017) · Energy · doi:10.1016/j.energy.2017.02.174 · Cited by 685
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metaheuristic Algorithms: A Comprehensive Review
Abdel-Basset, M., Abdel-Fatah, L., & Sangaiah, A. K. (2018) · Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications · doi:10.1016/b978-0-12-813314-9.00010-4 · Cited by 637
Simulation–Optimization Modeling: A Survey and Potential Application in Reservoir Systems Operation
Rani, D., & Moreira, M. M. (2010) · Water Resources Management · doi:10.1007/s11269-009-9488-0 · Cited by 460
Optimal planning of distributed generation systems in distribution system: A review
Viral, R., & Khatod, D. K. (2012) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2012.05.020 · Cited by 408
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Generalized Simulated Annealing for Global Optimization: The GenSA Package
Xiang, Y., Gubian, S., Suomela, B., & Hoeng, J. (2013) · The R Journal · doi:10.32614/rj-2013-002 · Cited by 372
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Efficiently Solving the Redundancy Allocation Problem Using Tabu Search
Kulturel-Konak, S., Smith, A. E., & Coit, D. W. (2003) · IIE Transactions · doi:10.1080/07408170304422 · Cited by 285
A heuristic approach to logistics network design for end-of-lease computer products recovery
Lee, D.-H., & Dong, M. (2008) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2006.11.003 · Cited by 280
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem
Mantawy, A. H., Abdel-Magid, Y. L., & Selim, S. Z. (1999) · IEEE Transactions on Power Systems · doi:10.1109/59.780892 · Cited by 265
Modularity and directionality in genetic interaction maps
Jaimovich, A., Rinott, R., Schuldiner, M., Margalit, H., & Friedman, N. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq197 · Cited by 32
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Romero, S. V., Visuri, A.-M., Cadavid, A. G., Simen, A., Solano, E., & Hegade, N. N. (2025) · Communications Physics · doi:10.1038/s42005-025-02270-3 · Cited by 18
“• Tabu search (TS) [94] with 100000 reads starting from randomly generated initial states.”
Metadata
- Authors
- Glover, F., Taillard, E., & Taillard, E.
- Venue
- Annals of Operations Research
- Published
- 1993-03
- Volume
- 41
- Issue
- 1
- Pages
- 1-28
- ISSN
- 0254-5330 (ISSN-L)
- 1572-9338
- OpenAlex
- W2114951958
- Cited by
- 902
- References
- 20
- FWCI
- 35.06
- 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
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.