Robust optimization over time -- A new perspective on dynamic optimization problems
Yu, X, Jin, Y, Tang, K and Yao, X (2010) Robust optimization over time -- A new perspective on dynamic optimization problems In: Congress on Evolutionary Computation, 2010-07-18 - ?, Barcelona.
Available under License : See the attached licence file.
Dynamic optimization problems (DOPs) are those whose specifications change over time during the optimization, resulting in continuously moving optima. Most research work on DOPs is based on the assumption that the goal of addressing DOPs is to track the moving optima. In this paper, we first point out the practical limitations on tracking the moving optima. We then propose to find optimal solutions that are robust over time as an alternative goal, which leads to a new concept of robust optimization over time (ROOT) problem. In order to investigate the properties of ROOT in more depth, we study the new characteristics of ROOT and investigate its similarities to and differences from the traditional robust optimization problem, which hereafter is referred to as robust optimization for short. To facilitate future research on ROOT, we suggest a ROOT benchmark problem by modifying the moving peaks test problem. Several performance measures for comparing algorithms for solving ROOT problems are proposed.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE|
|Divisions:||Faculty of Engineering and Physical Sciences > Computing Science|
|Depositing User:||Symplectic Elements|
|Date Deposited:||22 Jun 2012 17:45|
|Last Modified:||23 Sep 2013 19:27|
Actions (login required)
Downloads per month over past year