The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Experimental Methods for the Analysis of Optimization Algorithms
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
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
F-Race and Iterated F-Race: An Overview
Birattari, M., Yuan, Z., Balaprakash, P., & Stützle, T. (2010) · Experimental Methods for the Analysis of Optimization Algorithms · doi:10.1007/978-3-642-02538-9_13 · Cited by 413
Sequential Parameter Optimization
Bartz-Beielstein, T., Lasarczyk, C. W. G., & Preuss, M. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554761 · Cited by 300
Needed: An Empirical Science of Algorithms
Hooker, J. N. (1994) · Operations Research · doi:10.1287/opre.42.2.201 · Cited by 213
Hutter, F., Bartz–Beielstein, T., Hoos, H. H., Leyton‐Brown, K., & Murphy, K. P. (2010) · Springer eBooks · doi:10.1007/978-3-642-02538-9_15 · Cited by 18
Design and Analysis of Computational Experiments: Overview
Kleijnen, J. P. C. (2010) · Springer eBooks · doi:10.1007/978-3-642-02538-9_3 · Cited by 17
The Generation of Experimental Data for Computational Testing in Optimization
Hall, N. G., & Posner, M. E. (2010) · Springer eBooks · doi:10.1007/978-3-642-02538-9_4 · Cited by 15
Algorithm Configuration Problem
Iommazzo, G., D’Ambrosio, C., Frangioni, A., & Liberti, L. (2022) · Springer eBooks · doi:10.1007/978-3-030-54621-2_749-1 · Cited by 2
Cited by
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., & Stützle, T. (2016) · Operations Research Perspectives · doi:10.1016/j.orp.2016.09.002 · Cited by 1,761
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
Maier, H. R., Kapelan, Z., Kasprzyk, J., Kollat, J., Matott, L. S., Cunha, M. C., Dandy, G. C., Gibbs, M. S., Keedwell, E., Marchi, A., et al. (2014) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2014.09.013 · Cited by 657
Parameter tuning for configuring and analyzing evolutionary algorithms
Eiben, A. E., & Smit, S. K. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.001 · Cited by 622
A survey of variants and extensions of the location-routing problem
Drexl, M., & Schneider, M. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.08.030 · Cited by 465
Metadata
- Venue
- Springer eBooks
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- OpenAlex
- W1625914768
- Cited by
- 333
- References
- 9
- FWCI
- 10.92
- Type
- book
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Experimental Methods for the Analysis of Optimization Algorithms. https://app.cochat.ai/papers/10.1007/978-3-642-02538-9
- The paper
- Experimental Methods for the Analysis of Optimization Algorithms. (2010). Springer eBooks. https://doi.org/10.1007/978-3-642-02538-9
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.