Abstract
Recently the perspective of fixed budget computations has been added as a novel branch to the theory of evolutionary algorithms and other randomised search heuristics. It has been found that fixed budget results can provide a more detailed and fairer assessment of the performance of heuristic optimisation methods. Here, the focus is on well known simple heuristics where an understanding of their strengths and weaknesses has been developed in previous publications. It is shown that even on a relatively simple and well-understood example function the heuristics exhibit surprisingly complex and unexpected behaviour. In particular, a search heuristic which is known to be bad at hill-climbing in general is shown to be a very efficient hill-climber for a specific example problem.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 20th International Conference on Soft Computing (MENDEL 2014) |
| Editors | M. Radek |
| Publisher | Brno University of Technology |
| Pages | 293-298 |
| Number of pages | 6 |
| Publication status | Published - 2014 |
| Event | 20th International Conference on Soft Computing: Evolutionary Computation, Genetic Programming, Swarm Intelligence, Fuzzy Logic, Neural Networks, Fractals, Bayesian Methods, MENDEL 2014 - Brno, Czech Republic Duration: 25 Jun 2014 → 27 Jun 2014 |
Conference
| Conference | 20th International Conference on Soft Computing: Evolutionary Computation, Genetic Programming, Swarm Intelligence, Fuzzy Logic, Neural Networks, Fractals, Bayesian Methods, MENDEL 2014 |
|---|---|
| Country/Territory | Czech Republic |
| City | Brno |
| Period | 25/06/14 → 27/06/14 |
Keywords
- Artificial immune systems
- Evolutionary algorithms
- Fixed budget computations
- HIFF
- Random local search
- Run time analysis
ASJC Scopus subject areas
- Computer Science(all)
- Computational Mathematics
- Theoretical Computer Science