3-Objective Pareto Optimization for Problems with Chance Constraints

Frank Neumann, Carsten Witt
4/18/2023
cs.NEcs.AI

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Evolutionary multi-objective algorithms have successfully been used in the context of Pareto optimization where a given constraint is relaxed into an additional objective. In this paper, we explore the use of 3-objective formulations for problems with chance constraints. Our formulation trades off the expected cost and variance of the stochastic component as well as the given deterministic constraint. We point out benefits that this 3-objective formulation has compared to a bi-objective one recently investigated for chance constraints with Normally distributed stochastic components. Our analysis shows that the 3-objective formulation allows to compute all required trade-offs using 1-bit flips only, when dealing with a deterministic cardinality constraint. Furthermore, we carry out experimental investigations for the chance constrained dominating set problem and show the benefit for this classical NP-hard problem.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints

87% match2024

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem

84% match2024

Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties

82% match2023

Optimization for One, Feasibility for Most: Decoupling Optimization from Feasibility in Chance-Constrained Programs

77% match2026

Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems

76% match2024

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints

76% match2025

Cite this paper

@article{neumann2023objective,
  title  = {3-Objective Pareto Optimization for Problems with Chance Constraints},
  author = {Frank Neumann and Carsten Witt},
  year   = {2023},
  eprint = {2304.08774},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.08774v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.08774.svg)](https://codeofpaper.com/paper/2304.08774)

Discussion