Robust Multi-Objective optimization using Conditional Pareto Optimal Dominance

Seyedeh Zahra Mirjalili, Stephan Chalup, Seyedali Mirjalili, Nasimul Noman

Research output: Contribution to conferencePaperpeer-review

Abstract

Robust optimization of real-world problems is essential to reduce the significant negative impact of uncertainties and noises present in the environment. Uncertainties in the decision variables are often handled using explicit or implicit averaging methods, in which the fitness of a solution isjudged based on the objective values of neighbouring solutions. Explicit averaging methods are highly reliable but require additional objective function evaluation, which can significantly increases the overall computational cost of an optimization process. On the other hand, implicit averaging techniques are computationally cheap, yet they suffer from low reliability since they use the history of search in a population-based optimization algorithm. This work proposes a conditional Pareto optimal dominance to improve the reliability of robust optimization methods that use implicit averaging methods. The proposed method is applied to Multi-Objective Particle Swarm optimisation. Empirical study with a benchmark suite shows the benefit of the proposed conditional Pareto optimal dominance in locating robust solutions in multi-objective problems.

Original languageEnglish
DOIs
Publication statusPublished - Jul 2020
Event2020 IEEE Congress on Evolutionary Computation, CEC 2020 - Virtual, Glasgow, United Kingdom
Duration: 19 Jul 202024 Jul 2020

Conference

Conference2020 IEEE Congress on Evolutionary Computation, CEC 2020
CountryUnited Kingdom
CityVirtual, Glasgow
Period19/07/2024/07/20

Keywords

  • implicit averaging
  • multi-objective particle swarm optimization
  • robust optimization
  • uncertainties

Fingerprint Dive into the research topics of 'Robust Multi-Objective optimization using Conditional Pareto Optimal Dominance'. Together they form a unique fingerprint.

Cite this