Runtime analysis of non-elitist populations: from classical optimisation to partial information
Although widely applied in optimisation, relatively little has been proven rigorously about the role and behaviour of populations in randomised search processes. This paper presents a new method to prove upper bounds on the expected optimisation time of population-based randomised search heuristics...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Springer
2016
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31142/ |