Tuning an Algorithm Using Design of Experiments

DOI10.1007/978-3-642-02538-9_11MaRDI QIDQ3064524zbMATH OpenOpenAlexFDO

Authors Enda Ridge, Daniel Kudenko

Publication date 22 December 2010

Published in Experimental Methods for the Analysis of Optimization Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02538-9_11

zbMATH Keywords

algorithm performance

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 4187461
• An efficient algorithm for constructing optimal design of computer experiments
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• On a class of algorithms from experimental design theory
• Using experimental design to find effective parameter settings for heuristics

Cited in

(16)

• Best practices for comparing optimization algorithms
• Matheuristics for the single-path design-balanced service network design problem
• Large-scale vehicle routing problems: quantum annealing, tunings and results
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• Heuristics for periodical batch job scheduling in a MapReduce computing framework
• Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
• DOE-based parameter tuning for local branching algorithm
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
• Capacity consumption analysis using heuristic solution method for under construction railway routes
• Determining Whether a Problem Characteristic Affects Heuristic Performance
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• Surrogate-assisted tuning for computer experiments with qualitative and quantitative parameters
• A tuning method for bi-directional long short-term memory neural network model based on robust design
• The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
• Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
• A note on using performance and data profiles for training algorithms

This page was built for publication: Tuning an Algorithm Using Design of Experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064524)