title: On handling ephemeral resource constraints in evolutionary search.
abstract: We consider optimization problems where the set of solutions available for evaluation at any given time t during optimization is some subset of the feasible space. This model is appropriate to describe many closed-loop optimization settings (i.e., where physical processes or experiments are used to evaluate solutions) where, due to resource limitations, it may be impossible to evaluate particular solutions at particular times (despite the solutions being part of the feasible space). We call the constraints determining which solutions are non-evaluable ephemeral resource constraints (ERCs). In this paper, we investigate two specific types of ERC: one encodes periodic resource availabilities, the other models commitment constraints that make the evaluable part of the space a function of earlier evaluations conducted. In an experimental study, both types of constraint are seen to impact the performance of an evolutionary algorithm significantly. To deal with the effects of the ERCs, we propose and test five different constraint-handling policies (adapted from those used to handle standard constraints), using a number of different test functions including a fitness landscape from a real closed-loop problem. We show that knowing information about the type of resource constraint in advance may be sufficient to select an effective policy for dealing with it, even when advance knowledge of the fitness landscape is limited.
authors.affiliation: Department of Biochemical Engineering, University College London, London, WC1E 7JE, UK. r.allmendinger@ucl.ac.uk
authors.forename: Richard
authors.initials: R
authors.lastname: Allmendinger
authors.forename: Joshua
authors.initials: J
authors.lastname: Knowles
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D004843:Epistasis, Genetic; D008957:Models, Genetic; D012984:Software; D013997:Time Factors