New Optimization Heuristics
The DOI matches its Crossref record.
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
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
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
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Fifty Years of Vehicle Routing
Laporte, G. (2009) · Transportation Science · doi:10.1287/trsc.1090.0301 · Cited by 1,022
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
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
Bostanabad, R., Zhang, Y., Li, X., Kearney, T., Brinson, L. C., Apley, D. W., Liu, W. K., & Chen, W. (2018) · Progress in Materials Science · doi:10.1016/j.pmatsci.2018.01.005 · Cited by 434
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Origin and evolution of the genetic code: The universal enigma
Koonin, E. V., & Novozhilov, A. S. (2009) · IUBMB Life · doi:10.1002/iub.146 · Cited by 392
Record Breaking Optimization Results Using the Ruin and Recreate Principle
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000) · Journal of Computational Physics · doi:10.1006/jcph.1999.6413 · Cited by 413
Self-citationPisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
Distributions of Tree Comparison Metrics--Some New Results
Steel, M. A., & Penny, D. (1993) · Systematic Biology · doi:10.1093/sysbio/42.2.126 · Cited by 343
Learning Algorithms for Fuzzy Cognitive Maps—A Review Study
Papageorgiou, E. I. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2138694 · Cited by 322
Constructing test suites for interaction testing
Cohen, M. B., Gibbons, P. B., Mugridge, W. B., & Colbourn, C. J. (2003) · doi:10.5555/776816.776822 · Cited by 305
Metaheuristics: a comprehensive overview and classification along with bibliometric analysis
Ezugwu, A. E., Shukla, A. K., Nath, R., Akinyelu, A. A., Agushaka, J. O., Chiroma, H., & Muhuri, P. K. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09952-0 · Cited by 305
Positioning hydrogen atoms by optimizing hydrogen-bond networks in protein structures
Hooft, R. W. W., Sander, C., & Vriend, G. (1996) · Proteins: Structure, Function, and Genetics · doi:10.1002/(sici)1097-0134(199612)26:4<363::aid-prot1>3.0.co;2-d · Cited by 302
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
ORIGINS OF THE GENETIC CODE: The Escaped Triplet Theory
Yarus, M., Caporaso, J. G., & Knight, R. (2005) · Annual Review of Biochemistry · doi:10.1146/annurev.biochem.74.082803.133119 · Cited by 166
Green vehicle routing using mixed fleets for cold chain distribution
Chen, W., Zhang, D., Van Woensel, T., Xu, G., & Guo, J. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120979 · Cited by 61
Exceptional error minimization in putative primordial genetic codes
Novozhilov, A. S., & Koonin, E. V. (2009) · Biology Direct · doi:10.1186/1745-6150-4-44 · Cited by 37
“In most cases, a heuristic combinatorial algorithm was used (the Great Deluge Algorithm [ 65 ]), 3 to 5 solutions were identified, and the solution with the lowest cost was taken as the optimal.”
Method
Metadata
- Authors
- Dueck, G.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 1993-01
- Volume
- 104
- Issue
- 1
- Pages
- 86-92
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2030910540
- Cited by
- 765
- References
- 0
- FWCI
- 23.21
- 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.