Authors
Richard Allmendinger, Joshua Knowles
Publication date
2013/9/1
Journal
Evolutionary computation
Volume
21
Issue
3
Pages
497-531
Publisher
MIT Press
Description
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 …
Total citations
201320142015201620172018201920202021202220232024115313271
Scholar articles