Tuning an Algorithm Using Design of Experiments
From MaRDI portal
Publication:3064524
DOI10.1007/978-3-642-02538-9_11zbMath1206.68380OpenAlexW1652620451MaRDI QIDQ3064524
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
Related Items (11)
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 ⋮ The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ 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 ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ 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
This page was built for publication: Tuning an Algorithm Using Design of Experiments
