TY - JOUR

T1 - Particle Swarm Metaheuristics for Robust Optimisation with Implementation Uncertainty

AU - Hughes, Martin

AU - Goerigk, Marc

AU - Dokka Venkata Satyanaraya, Trivikram

PY - 2020/10/1

Y1 - 2020/10/1

N2 - We consider global non-convex optimisation problems under uncertainty. In this setting, it is not possible to implement a desired solution exactly. Instead, any other solution within some distance to the intended solution may be implemented. The aim is to find a robust solution, i.e., one where the worst possible solution nearby still performs as well as possible. Problems of this type exhibit another maximisation layer to find the worst case solution within the minimisation level of finding a robust solution, which makes them harder to solve than classic global optimisation problems. So far, only few methods have been provided that can be applied to black-box problems with implementation uncertainty. We improve upon existing techniques by introducing a novel particle swarm based framework which adapts elements of previous methods, combining them with new features in order to generate a more effective approach. In computational experiments, we find that our new method outperforms state of the art comparator heuristics in almost 80% of cases.

AB - We consider global non-convex optimisation problems under uncertainty. In this setting, it is not possible to implement a desired solution exactly. Instead, any other solution within some distance to the intended solution may be implemented. The aim is to find a robust solution, i.e., one where the worst possible solution nearby still performs as well as possible. Problems of this type exhibit another maximisation layer to find the worst case solution within the minimisation level of finding a robust solution, which makes them harder to solve than classic global optimisation problems. So far, only few methods have been provided that can be applied to black-box problems with implementation uncertainty. We improve upon existing techniques by introducing a novel particle swarm based framework which adapts elements of previous methods, combining them with new features in order to generate a more effective approach. In computational experiments, we find that our new method outperforms state of the art comparator heuristics in almost 80% of cases.

KW - Robust optimisation

KW - Implementation uncertainty

KW - Metaheuristics

KW - Global optimisation

KW - Particle swarm optimisation

U2 - 10.1016/j.cor.2020.104998

DO - 10.1016/j.cor.2020.104998

M3 - Journal article

VL - 122

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

M1 - 104998

ER -