Mean-based Borda count for paradox-free comparisons of optimization algorithms
From MaRDI portal
Recommendations
- Benchmarking deterministic optimization algorithms using an outranking approach
- scientific article; zbMATH DE number 4112399
- scientific article; zbMATH DE number 3912142
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Best practices for comparing optimization algorithms
Cites work
- A Consistent Extension of Condorcet’s Election Principle
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Condorcet's paradox
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- Independence of clones as a criterion for voting rules
- Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Statistical comparisons of classifiers over multiple data sets
- The original Borda count and partial voting
This page was built for publication: Mean-based Borda count for paradox-free comparisons of optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198764)