The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Iterated Local Search
Open accessAbstract
This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems. It is based on building a sequence of (locally optimal) solutions by: (1) perturbing the current solution; (2) applying local search to that modified solution. At a high level, the method is simple, yet it allows for a detailed use of problem-specific properties. After giving a general framework, we cover the uses of Iterated Local Search on a number of well studied problems.
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
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
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
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
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
Ant colony optimization: a new meta-heuristic
Dorigo, M., & Di Caro, G. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782657 · Cited by 2,137
The Ant Colony Optimization Metaheuristic
(2004) · Ant Colony Optimization · doi:10.7551/mitpress/1290.003.0004 · Cited by 1,406
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
Battiti, R., & Tecchiolli, G. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.126 · Cited by 801
The one-machine sequencing problem
Carlier, J. (1982) · European Journal of Operational Research · doi:10.1016/s0377-2217(82)80007-6 · Cited by 528
Fast Algorithms for Geometric Traveling Salesman Problems
Bentley, J. J. (1992) · ORSA Journal on Computing · doi:10.1287/ijoc.4.4.387 · Cited by 468
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
Balas, E., & Vazacopoulos, A. (1998) · Management Science · doi:10.1287/mnsc.44.2.262 · Cited by 407
The primal-dual method for approximation algorithms and its application to network design problems
Goemans, M. X., & Williamson, D. P. (1996) · PWS Publishing Co. eBooks · Cited by 365
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
Evolution in Time and Space – The Parallel Genetic Algorithm
Mühlenbein, H. (1991) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-050684-5.50023-9 · Cited by 328
Comparison of iterative searches for the quadratic assignment problem
Taillard, É. D. (1995) · Location Science · doi:10.1016/0966-8349(95)00008-6 · Cited by 325
Large-step Markov chains for the Traveling Salesman Problem
Martin, O. (2018) · doi:10.6083/nk322d67m · Cited by 321
Self-citationAn Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.1.52.7712 · Cited by 306
Job shop scheduling by local search
Aarts, E. E., Lenstra, J. J. K., Laarhoven, P. P. V., & Ulder, N. N. (1992) · TU/e Research Portal · Cited by 232
Combining simulated annealing with local search heuristics
Martin, O. C., & Otto, S. W. (1996) · Annals of Operations Research · doi:10.1007/bf02601639 · Cited by 216
Self-citationLarge-step markov chains for the TSP incorporating local search heuristics
Martin, O., Otto, S. W., & Felten, E. W. (1992) · Operations Research Letters · doi:10.1016/0167-6377(92)90028-2 · Cited by 201
Self-citationLocal Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
Crauwels, H., Potts, C. N., & Wassenhove, L. N. V. (1998) · INFORMS journal on computing · doi:10.1287/ijoc.10.3.341 · Cited by 171
Local Search Algorithms for Combinatorial Problems - Analysis, Improvements and New Applications
Stützle, T. (1999) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 161
Self-citationLocal search with perturbations for the prize‐collecting Steiner tree problem in graphs
Canuto, S. A., Resende, M. G. C., & Ribeiro, C. C. (2001) · Networks · doi:10.1002/net.1023 · Cited by 154
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Merz, P., & Freisleben, B. (2000) · Evolutionary Computation · doi:10.1162/106365600568103 · Cited by 144
Local Optima Avoidance in Depot Location
Baxter, J. (1981) · Journal of the Operational Research Society · doi:10.1057/jors.1981.159 · Cited by 139
Scatter Search and Path Relinking
Martí, R., Pantrigo, J. J., Duarte, A., Campos, V., & Glover, F. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-2479-5.ch001 · Cited by 133
Greedy, prohibition, and reactive heuristics for graph partitioning
Battiti, R., & Bertossi, A. A. (1999) · IEEE Transactions on Computers · doi:10.1109/12.762522 · Cited by 116
Reactive search, a history-sensitive heuristic for MAX-SAT
Battiti, R., & Protasi, M. (1997) · ACM Journal of Experimental Algorithmics · doi:10.1145/264216.264220 · Cited by 94
Improving local search heuristics for some scheduling problems. Part II
Brucker, P., Hurink, J. L., & Werner, F. M. (1997) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(96)00036-4 · Cited by 86
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
Hu, T. C., Kahng, A. B., & Tsao, C.-W. A. (1995) · INFORMS journal on computing · doi:10.1287/ijoc.7.4.417 · Cited by 78
Fitness Landscapes and Performance of Meta-Heuristics
Fonlupt, C., Robilliard, D., Preux, P., & Talbi, E. (1999) · Springer eBooks · doi:10.1007/978-1-4615-5775-3_18 · Cited by 30
A Comparison of Nature Inspired Heuristics on the Traveling Salesman Problem
Stützle, T., Grün, A., Linke, S., & Rüttger, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45356-3_65 · Cited by 30
Self-citation
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
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A. M., & Talbi, E.-G. (2022) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.04.032 · Cited by 462
Blum, C. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2003.11.018 · Cited by 421
A Survey of Automatic Parameter Tuning Methods for Metaheuristics
Huang, C., Li, Y., & Yao, X. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2921598 · Cited by 371
Metadata
- Authors
- Lourenço, H. R., Martin, O. C., & Stützle, T.
- Venue
- International Series in Operations Research & Management Science
- Publisher
- Kluwer Academic Publishers
- Published
- 2006-02-02
- Pages
- 320-353
- OpenAlex
- W2949474276
- Cited by
- 1,164
- References
- 43
- FWCI
- 75.74
- Type
- book chapter
- Language
- en
- Open access
- green
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.