A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space
From MaRDI portal
Publication:2212583
Recommendations
- Deep statistical comparison for meta-heuristic stochastic optimization algorithms
- Statistical learning makes the hybridization of particle swarm and differential evolution more efficient --- a novel hybrid optimizer
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Statistical heuristic search
Cites work
- A multivariate two-sample test based on the number of nearest neighbor type coincidences
- 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
- Computing the nearest correlation matrix--a problem from finance
- Consistency of general bootstrap methods for degenerate U-type and V-type statistics
- Firefly Algorithms for Multimodal Optimization
- Multivariate Two-Sample Tests Based on Nearest Neighbors
- Principal component analysis.
- Random matrix theory
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(3)
This page was built for publication: A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212583)