Experimental research in evolutionary computation. The new experimentalism
DOI10.1007/3-540-32027-XzbMATH Open1106.68037OpenAlexW2168065615MaRDI QIDQ2492011FDOQ2492011
Publication date: 31 May 2006
Published in: Natural Computing Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-32027-x
Recommendations
- Evolutionary computation. Techniques and applications
- Design and Analysis of Optimization Algorithms Using Computational Statistics
- Evolutionary statistical procedures. An evolutionary computation approach to statistical procedures designs and applications
- Evolutionary Computation for Modeling and Optimization
- Advances in evolutionary algorithms. Theory, design and practice.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) General topics in the theory of computing (68Q01)
Cited In (14)
- Microforecasting methods for fresh food supply chain management: a computational study
- Algorithm runtime prediction: methods \& evaluation
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- 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
- Robust optimization - a comprehensive survey
- Evolutionary self-adaptation: a survey of operators and strategy parameters
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
- A multilevel evaluation method for heuristics with an application to the VRPTW
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem
- FUZZY OPERATOR TREES FOR MODELING RATING FUNCTIONS
- How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
- Automatically improving the anytime behaviour of optimisation algorithms
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
Uses Software
This page was built for publication: Experimental research in evolutionary computation. The new experimentalism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492011)
