The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Tabu Search—Part II
Abstract
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part II, in this issue, examines refinements and more advanced aspects of tabu search. Following a brief review of notation, Part II introduces new dynamic strategies for managing tabu lists, allowing fuller exploitation of underlying evaluation functions. In turn, the elements of staged search and structured move sets are characterized, which bear on the issue of finiteness. Three ways of applying tabu search to the solution of integer programming problems are then described, providing connections also to certain nonlinear programming applications. Finally, the paper concludes with a brief survey of new applications of tabu search that have occurred since the developments reported in Part I. Together with additional comparisons with other methods on a wide body of problems, these include results of parallel processing implementations and the use of tabu search in settings ranging from telecommunications to 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.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Future 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-citationThe Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
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-citationConvergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Using 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
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Karp, R. M. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.209 · Cited by 439
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
Cited by
Items 101–133 of 133
Supervised Regionalization Methods: A Survey
Duque, J. C., Ramos, R., & Suriñach, J. (2007) · International Regional Science Review · doi:10.1177/0160017607301605 · Cited by 318
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
Wolfe, W. J., & Sorensen, S. E. (2000) · Management Science · doi:10.1287/mnsc.46.1.148.15134 · Cited by 313
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Osaba, E., Yang, X.-S., Diaz, F., Lopez-Garcia, P., & Carballedo, R. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2015.10.006 · Cited by 312
Bagnall, A. J., Rayward-Smith, V. J., & Whittley, I. M. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00194-x · Cited by 311
Das, B., Mukherjee, V., & Das, D. (2020) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2020.102804 · Cited by 305
Oppositional biogeography-based optimization
Ergezer, M., Simon, D., & Du, D. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346043 · Cited by 300
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
Jans, R., & Degraeve, Z. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.12.008 · Cited by 297
Variable Neighborhood Decomposition Search
Hansen, P., Mladenović, N., & Perez-Britos, D. (2001) · Journal of Heuristics · doi:10.1023/a:1011336210885 · Cited by 296
Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Scholl, A., Klein, R., & Jürgens, C. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(96)00082-2 · Cited by 295
Optimal power flow: a bibliographic survey II: Non-deterministic and hybrid methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0057-x · Cited by 294
Heuristics from nature for hard combinatorial optimization problems
Colorni, A. (1996) · International Transactions in Operational Research · doi:10.1016/0969-6016(96)00004-4 · Cited by 288
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
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
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
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
Kammerdiner, A., Gevezes, T., Pasiliao, E., Pitsoulis, L., & Pardalos, P. M. (2013) · Encyclopedia of Operations Research and Management Science · doi:10.1007/978-1-4419-1153-7_1152 · Cited by 273
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
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
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
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
A 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
(2005) · Cited by 38
Online perceptual learning and natural language acquisition for autonomous robots
Alomari, M., Li, F., Hogg, D. C., & Cohn, A. G. (2022) · Artificial Intelligence · doi:10.1016/j.artint.2021.103637 · Cited by 17
Metadata
- Authors
- Glover, F.
- Venue
- ORSA Journal on Computing
- Published
- 1990-02
- Volume
- 2
- Issue
- 1
- Pages
- 4-32
- ISSN
- 0899-1499 (ISSN-L)
- 2326-3245
- OpenAlex
- W2104670598
- Cited by
- 5,647
- References
- 12
- FWCI
- 41.94
- 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.