The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
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
(1979) · Cited by 43,841
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
Practical Nonparametric Statistics
Groggel, D. J. (2000) · Technometrics · doi:10.1080/00401706.2000.10486067 · Cited by 11,041
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
The visual display of quantitative information
(1985) · General Pharmacology: The Vascular System · doi:10.1016/0306-3623(85)90230-7 · Cited by 5,070
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
Limiting forms of the frequency distribution of the largest or smallest member of a sample
Fisher, R. A., & Tippett, L. H. C. (1928) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100015681 · Cited by 3,310
Kemp, C. D., & Tufte, E. R. (1992) · Biometrics · doi:10.2307/2532323 · Cited by 2,713
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
Tukey, J. W. (1977) · International Linear Collider · Cited by 2,155
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
Practical Nonparametric Statistics
Conover, W. J. (1971) · Cited by 1,465
Hard and easy distributions of SAT problems
Mitchell, D. G. M., Selman, B., & Levesque, H. J. (1992) · Cited by 799
The Visual Display of Quantitative Information
Reidhaar, J. W., & Tufte, E. R. (1986) · Design Issues · doi:10.2307/1571646 · Cited by 781
Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules
Fisher, H. F. (1963) · Medical Entomology and Zoology · Cited by 729
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
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
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
A stochastic method for global optimization
Boender, C. G. E., Rinnooy Kan, A. H. G., Timmer, G. T., & Stougie, L. (1982) · Mathematical Programming · doi:10.1007/bf01581033 · Cited by 257
Needed: An Empirical Science of Algorithms
Hooker, J. N. (1994) · Operations Research · doi:10.1287/opre.42.2.201 · Cited by 213
Experimental results on the crossover point in satisfiability problems
Crawford, J. M., & Auton, L. D. (1993) · Cited by 209
Sequencing by enumerative methods
Lenstra, J. K. (1977) · Data Archiving and Networked Services (DANS) · Cited by 164
On Reporting Computational Experiments with Mathematical Software
Crowder, H. P., Dembo, R. S., & Mulvey, J. M. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355826.355833 · Cited by 83
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
Zemel, E. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.3.319 · Cited by 77
Hill, R. R., & Reilly, C. H. (2000) · Management Science · doi:10.1287/mnsc.46.2.302.11930 · Cited by 76
Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
Coffman, E. G., Lueker, G. S., & Kan, A. H. G. R. (1988) · Management Science · doi:10.1287/mnsc.34.3.266 · Cited by 64
Experimentation in optimization
Golden, B., Assad, A. A., Wasil, E., & Baker, E. K. (1986) · European Journal of Operational Research · doi:10.1016/s0377-2217(86)80002-9 · Cited by 18
Cited by
Metaheuristics—the metaphor exposed
Sörensen, K. (2015) · International Transactions in Operational Research · doi:10.1111/itor.12001 · Cited by 1,051
Software-Defined Networking for Internet of Things: A Survey
Bera, S., Misra, S., & Vasilakos, A. V. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2746186 · Cited by 391
Parallel metaheuristics: recent advances and new trends
Alba, E., Luque, G., & Nesmachnow, S. (2013) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.2012.00862.x · Cited by 305
Fitness-distance balance (FDB): A new selection method for meta-heuristic search algorithms
Kahraman, H. T., Aras, S., & Gedikli, E. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.105169 · 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
Metadata
- Authors
- Rardin, R. L., & Uzsoy, R.
- Venue
- Journal of Heuristics
- Published
- 2001-05
- Volume
- 7
- Issue
- 3
- Pages
- 261-304
- ISSN
- 1381-1231 (ISSN-L)
- 1572-9397
- OpenAlex
- W2113957471
- Cited by
- 332
- References
- 27
- FWCI
- 6.76
- 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.