The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Abstract
Researchers and practitioners frequently spend more time fine-tuning algorithms than designing and implementing them. This is particularly true when developing heuristics and metaheuristics, where the “right” choice of values for search parameters has a considerable effect on the performance of the procedure. When testing metaheuristics, performance typically is measured considering both the quality of the solutions obtained and the time needed to find them. In this paper, we describe the development of CALIBRA, a procedure that attempts to find the best values for up to five search parameters associated with a procedure under study. Because CALIBRA uses Taguchi’s fractional factorial experimental designs coupled with a local search procedure, the best values found are not guaranteed to be optimal. We test CALIBRA on six existing heuristic-based procedures. These experiments show that CALIBRA is able to find parameter values that either match or improve the performance of the procedures resulting from using the parameter values suggested by their developers. The latest version of CALIBRA can be downloaded for free from the website that appears in the online supplement of this paper at http://or.pubs.informs.org/Pages.collect.html.
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
Applied Linear Statistical Models
Ziegel, E. R., Neter, J., Wasserman, W., & Kutner, M. (1992) · Technometrics · doi:10.2307/1269588 · Cited by 9,907
Applied Linear Statistical Models
(1997) · Technometrics · doi:10.1080/00401706.1997.10485141 · Cited by 7,185
Applied Linear Statistical Models.
Lorenz, F., Neter, J., Wasserman, W., & Kutner, M. H. (1986) · Journal of the American Statistical Association · doi:10.2307/2289108 · Cited by 5,565
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
Design and Analysis of Experiments
Sullivan, G. R. (1998) · Journal of Quality Technology · doi:10.1080/00224065.1998.11979826 · Cited by 1,877
A Primer on the Taguchi Method
Roy, R. (1990) · Medical Entomology and Zoology · Cited by 1,196
Orthogonal Arrays: Theory and Applications
Deng, L.-Y. (2000) · Technometrics · doi:10.1080/00401706.2000.10485735 · Cited by 1,079
Hedayat, A. S., Sloane, N. J. A., & Stufken, J. (1999) · Springer Series in Statistics · doi:10.1007/978-1-4612-1478-6 · Cited by 971
System of experimental design : engineering methods to optimize quality and minimize costs
Taguchi, G. (1987) · Cited by 685
Cellular manufacturing in the U.S. industry: a survey of users
WEMMERLÖV, U., & HYER, N. L. (1989) · International Journal of Production Research · doi:10.1080/00207548908942637 · Cited by 574
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
Taguchi methods : design of experiments
Taguchi, G.-I., & Yokoyama, Y. (1993) · Medical Entomology and Zoology · Cited by 389
A Jinear formulation of the machine-part cell formation problem
BOCTOR, F. F. (1991) · International Journal of Production Research · doi:10.1080/00207549108930075 · Cited by 325
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
Optimization Software Class Libraries
VoÃ, S., & Woodruff, D. L. (2002) · Operations research, computer science. Interface series · doi:10.1007/b101931 · Cited by 115
The Reporting of Computation-Based Results in Statistics
Hoaglin, D. C., & Andrews, D. F. (1975) · The American Statistician · doi:10.1080/00031305.1975.10477393 · Cited by 90
A One-Step Tabu Search Algorithm for Manufacturing Cell Design
Lozano, S., Adenso-Díaz, B., Eguía, I., & Onieva, L. (1999) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600704 · Cited by 89
Self-citationFine-tuning a tabu search algorithm with statistical tests
Xu, J., Chiu, S. Y., & Glover, F. (1998) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.1998.tb00117.x · Cited by 78
Network Reoptimization Algorithms: A Statistically Designed Comparison
Amini, M. M., & Barr, R. S. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.4.395 · Cited by 15
Cited by
Sequential Model-Based Optimization for General Algorithm Configuration
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25566-3_40 · Cited by 2,469
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
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
Metaheuristics—the metaphor exposed
Sörensen, K. (2015) · International Transactions in Operational Research · doi:10.1111/itor.12001 · Cited by 1,051
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
Metadata
- Authors
- Adenso-Díaz, B., & Laguna, M.
- Venue
- Operations Research
- Published
- 2006-02
- Volume
- 54
- Issue
- 1
- Pages
- 99-114
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2031585418
- Cited by
- 435
- References
- 22
- FWCI
- 20.67
- 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.