The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Metaheuristics—the metaphor exposed
Open accessAbstract
In recent years, the field of combinatorial optimization has witnessed a true tsunami of “novel” metaheuristic methods, most of them based on a metaphor of some natural or man‐made process. The behavior of virtually any species of insects, the flow of water, musicians playing together – it seems that no idea is too far‐fetched to serve as inspiration to launch yet another metaheuristic. In this paper, we will argue that this line of research is threatening to lead the area of metaheuristics away from scientific rigor. We will examine the historical context that gave rise to the increasing use of metaphors as inspiration and justification for the development of new methods, discuss the reasons for the vulnerability of the metaheuristics field to this line of research, and point out its fallacies. At the same time, truly innovative research of high quality is being performed as well. We conclude the paper by discussing some of the properties of this research and by pointing out some of the most promising research avenues for the field of metaheuristics.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Cuckoo Search via Lévy flights
Yang, X.-S., & Deb, S. (2009) · 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2009.5393690 · Cited by 6,185
Glover, F., & Laguna, M. (1997) · Cited by 5,679
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
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
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Atashpaz-Gargari, E., & Lucas, C. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4425083 · Cited by 2,628
Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
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
How to Solve It. A New Aspect of Mathematical Method.
Bell, E. T., & Polya, G. (1945) · The American Mathematical Monthly · doi:10.2307/2306109 · Cited by 1,806
How to Solve It: A New Aspect of Mathematical Method
Polya, G. (1945) · Princeton University Press eBooks · doi:10.1515/9781400828678 · Cited by 1,652
A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example
Pan, W.-T. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.07.001 · Cited by 1,543
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
Heuristic Problem Solving: The Next Advance in Operations Research
Simon, H. A., & Newell, A. (1958) · Operations Research · doi:10.1287/opre.6.1.1 · Cited by 620
(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-63007-2 · Cited by 592
The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm
Hosseini, H. S. (2009) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2009.022775 · Cited by 473
Designing and reporting on computational experiments with heuristic methods
Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., & Stewart, W. R. (1995) · Journal of Heuristics · doi:10.1007/bf02430363 · Cited by 448
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Adenso-Díaz, B., & Laguna, M. (2006) · Operations Research · doi:10.1287/opre.1050.0243 · Cited by 435
Firefly Algorithm for Continuous Constrained Optimization Tasks
Łukasik, S., & Żak, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04441-0_8 · Cited by 435
Michel, L., & Van Hentenryck, P. (2017) · Handbook of Heuristics · doi:10.1007/978-3-319-07153-4_7-1 · Cited by 348
Krishnanand, K. N., & Ghose, D. (2005) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2005.1501606 · Cited by 345
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
Rardin, R. L., & Uzsoy, R. (2001) · Journal of Heuristics · doi:10.1023/a:1011319115230 · Cited by 332
On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers
Nakrani, S., & Tovey, C. A. (2004) · Adaptive Behavior · doi:10.1177/105971230401200308 · Cited by 295
Michel, L., & Hentenryck, P. V. (2018) · Handbook of Heuristics · doi:10.1007/978-3-319-07124-4_7 · Cited by 230
Using Experimental Design to Find Effective Parameter Settings for Heuristics
Coy, S. P., Golden, B. L., Runger, G. C., & Wasil, E. A. (2001) · Journal of Heuristics · doi:10.1023/a:1026569813391 · Cited by 228
GRASP and path relinking for the max–min diversity problem
Resende, M. G. C., Martí, R., Gallego, M., & Duarte, A. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2008.05.011 · Cited by 203
Sörensen, K., & Glover, F. (2013) · Springer eBooks · doi:10.1007/978-1-4419-1153-7_1167 · Cited by 175
Self-citationA Rigorous Analysis of the Harmony Search Algorithm
Weyland, D. (2010) · International Journal of Applied Metaheuristic Computing · doi:10.4018/jamc.2010040104 · Cited by 154
Adaptive and Multilevel Metaheuristics
Cotta, C., Sevaux, M., & Sörensen, K. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-79438-7 · Cited by 124
Self-citation20th Iranian Conference on Electrical Engineering (ICEE2012)
(2012) · doi:10.1109/icee20235.2012 · Cited by 64
A novel Fly Optimization Algorithm for swarming application
Abidin, Z. Z., Ngah, U. K., Arshad, M. R., & Ping, O. B. (2010) · IEEE Conference on Robotics, Automation and Mechatronics (RAM) · doi:10.1109/ramech.2010.5513157 · Cited by 4
Cited by
An improved grey wolf optimizer for solving engineering problems
Nadimi-Shahraki, M. H., Taghian, S., & Mirjalili, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113917 · Cited by 1,153
RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
Ahmadianfar, I., Heidari, A. A., Gandomi, A. H., Chu, X., & Chen, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115079 · Cited by 1,115
A novel nature-inspired algorithm for optimization: Squirrel search algorithm
Jain, M., Singh, V., & Rani, A. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.02.013 · Cited by 961
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
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Metadata
- Authors
- Sörensen, K.
- Venue
- International Transactions in Operational Research
- Publisher
- Wiley
- Published
- 2013-02-08
- Volume
- 22
- Issue
- 1
- Pages
- 3-18
- ISSN
- 0969-6016 (ISSN-L)
- 1475-3995
- OpenAlex
- W2032982318
- Cited by
- 1,051
- References
- 40
- FWCI
- 36.81
- Type
- journal article
- Language
- en
- Open access
- bronze
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.