The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Tabu Search: A Tutorial
Abstract
Tabu search is a “higher level” heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical and practical problems in applications ranging from scheduling to telecommunications and from character recognition to neural networks. It uses flexible structures memory (to permit search information to be exploited more thoroughly than by rigid memory systems or memoryless systems), conditions for strategically constraining and freeing the search process (embodied in tabu restrictions and aspiration criteria), and memory functions of varying time spans for intensifying and diversifying the search (reinforcing attributes historically found good and driving the search into new regions). Tabu search can be integrated with branch-and-bound and cutting plane procedures, and it has the ability to start with a simple implementation that can be upgraded over time to incorporate more advanced or specialized elements.
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-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-citationUsing tabu search techniques for graph coloring
Hertz, A., & de Werra, D. (1987) · Computing · doi:10.1007/bf02239976 · Cited by 657
Tabu Search Applied to the Quadratic Assignment Problem
Skorin‐Kapov, J. (1990) · INFORMS journal on computing · doi:10.1287/ijoc.2.1.33 · Cited by 458
The Backboard Wiring Problem: A Placement Algorithm
Steinberg, L. (1961) · SIAM Review · doi:10.1137/1003003 · Cited by 379
Algorithms for the maximum satisfiability problem
Hansen, P., & Jaumard, B. (1990) · Computing · doi:10.1007/bf02241270 · Cited by 360
The general employee scheduling problem. An integration of MS and AI
Glover, F., & McMillan, C. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90050-x · Cited by 295
Self-citationNew approaches for heuristic search: A bilateral linkage with artificial intelligence
Glover, F., & Greenberg, H. J. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90185-9 · Cited by 244
Self-citationTabu search techniques: A tutorial and an application to neural networks
de Werra, D., & Hertz, A. (1989) · Operations-Research-Spektrum · doi:10.1007/bf01720782 · Cited by 217
The tabu search metaheuristic: How we used it
Hertz, A., & de Werra, D. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531073 · Cited by 170
Cited by
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Search-based software engineering
Harman, M., & Jones, B. F. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00189-6 · Cited by 914
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Hall, N. G., & Sriskandarajah, C. (1996) · Operations Research · doi:10.1287/opre.44.3.510 · Cited by 842
State-of-the-art review of optimization methods for short-term scheduling of batch processes
Méndez, C. A., Cerdá, J., Grossmann, I. E., Harjunkoski, I., & Fahl, M. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.02.008 · Cited by 809
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metadata
- Authors
- Glover, F.
- Venue
- Interfaces
- Published
- 1990-08
- Volume
- 20
- Issue
- 4
- Pages
- 74-94
- ISSN
- 0092-2102 (ISSN-L)
- 1526-551X
- OpenAlex
- W1995714897
- Cited by
- 1,092
- References
- 10
- FWCI
- 7.91
- 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.