A Simple Yet Effective Approach to Robust Optimization Over Time

07/22/2019
by   Lukáš Adam, et al.
0

Robust optimization over time (ROOT) refers to an optimization problem where its performance is evaluated over a period of future time. Most of the existing algorithms use particle swarm optimization combined with another method which predicts future solutions to the optimization problem. We argue that this approach may perform subpar and suggest instead a method based on a random sampling of the search space. We prove its theoretical guarantees and show that it significantly outperforms the state-of-the-art methods for ROOT.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/16/2012

A Bayesian Interpretation of the Particle Swarm Optimization and Its Kernel Extension

Particle swarm optimization is a popular method for solving difficult op...
05/25/2005

Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space

The periodic mode is analyzed together with two conventional boundary ha...
08/17/2022

Survey of Methods for Solving Systems of Nonlinear Equations, Part I: Root-finding Approaches

This paper presents a comprehensive survey of methods which can be utili...
08/17/2022

Survey of Methods for Solving Systems of Nonlinear Equations, Part II: Optimization Based Approaches

This paper presents a comprehensive survey of methods which can be utili...
10/14/2019

Adaptive Neuro Particle Swarm Optimization applied for diagnosing disorders

A new Adaptive Neuro Particle Swarm Optimization (ANPSO) combined with a...
01/06/2021

On Satisficing in Quantitative Games

Several problems in planning and reactive synthesis can be reduced to th...
10/02/2018

Robust Optimization through Neuroevolution

We propose a method for evolving solutions that are robust with respect ...

Code Repositories