The DOI matches its Crossref record.
Tabu Search—Part I
Abstract
This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more recently has demonstrated its value in treating classical problems such as the traveling salesman and graph coloring problems. Nevertheless, the approach is still in its infancy, and a good deal remains to be discovered about its most effective forms of implementation and about the range of problems for which it is best suited. This paper undertakes to present the major ideas and findings to date, and to indicate challenges for future research. Part I of this study indicates the basic principles, ranging from the short-term memory process at the core of the search to the intermediate and long term memory processes for intensifying and diversifying the search. Included are illustrative data structures for implementing the tabu conditions (and associated aspiration criteria) that underlie these processes. Part I concludes with a discussion of probabilistic tabu search and a summary of computational experience for a variety of applications. Part II of this study (to appear in a subsequent issue) examines more advanced considerations, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness. Part II also describes tabu search methods for solving mixed integer programming problems and gives a brief summary of additional practical experience, including the use of tabu search to guide other types of processes, such as those of neural networks. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
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
Cited by
Items 101–117 of 117
Natural computing for mechanical systems research: A tutorial overview
Worden, K., Staszewski, W. J., & Hensman, J. J. (2011) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2010.07.013 · Cited by 288
An intensify Harris Hawks optimizer for numerical and engineering optimization problems
Kamboj, V. K., Nandi, A., Bhadoria, A., & Sehgal, S. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.106018 · Cited by 288
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
Ant colony optimization combined with taboo search for the job shop scheduling problem
Huang, K.-L., & Liao, C.-J. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2006.07.003 · Cited by 278
A Robust Genetic Algorithm for Resource Allocation in Project Scheduling
Alcaraz, J., & Maroto, C. (2001) · Annals of Operations Research · doi:10.1023/a:1010949931021 · Cited by 275
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Erdelić, T., & Carić, T. (2019) · Journal of Advanced Transportation · doi:10.1155/2019/5075671 · Cited by 270
UAV Path Planning Using Optimization Approaches: A Survey
Ait Saadi, A., Soukane, A., Meraihi, Y., Benmessaoud Gabis, A., Mirjalili, S., & Ramdane-Cherif, A. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09742-7 · Cited by 269
Feature selection using tabu search method
Zhang, H., & Sun, G. (2002) · Pattern Recognition · doi:10.1016/s0031-3203(01)00046-2 · Cited by 268
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
Recent advances in neuro-fuzzy system: A survey
Shihabudheen, K. V., & Pillai, G. N. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.04.014 · Cited by 261
Different metaheuristic strategies to solve the feature selection problem
Yusta, S. C. (2009) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.11.012 · Cited by 258
Abualigah, L., & Diabat, A. (2020) · Neural Computing and Applications · doi:10.1007/s00521-020-04789-8 · Cited by 255
Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
O’Malley, D., Vesselinov, V. V., Alexandrov, B. S., & Alexandrov, L. B. (2018) · PLOS ONE · doi:10.1371/journal.pone.0206653 · Cited by 140
A review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
“methods, such as tabu search [68] and iterated local search [106] and multi-point (population)-based search methods,”
MethodA survey of the literature on airline crew scheduling
Deveci, M., & Demirel, N. Ç. (2018) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2018.05.008 · Cited by 71
Xhafa, F., & Ip, A. W. H. (2021) · Enterprise Information Systems · doi:10.1080/17517575.2019.1593508 · Cited by 57
A hybrid approach for integrated healthcare cooperative purchasing and supply chain configuration
Rego, N., Claro, J., & Pinho de Sousa, J. (2014) · Health Care Management Science · doi:10.1007/s10729-013-9262-y · Cited by 55
Metadata
- Authors
- Glover, F.
- Venue
- ORSA Journal on Computing
- Published
- 1989-08
- Volume
- 1
- Issue
- 3
- Pages
- 190-206
- ISSN
- 0899-1499 (ISSN-L)
- 2326-3245
- OpenAlex
- W4246598646
- Cited by
- 5,106
- References
- 0
- FWCI
- 14.58
- 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.