4 papers
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
Xiankun Yan, Aneta Neumann, Frank Neumann
Variants of the GSEMO algorithm using multi-objective formulations have been successfully analyzed and applied to optimize chance-constrained submodular functions. However, due to…
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems
Xiankun Yan, Aneta Neumann, Frank Neumann
Recently surrogate functions based on the tail inequalities were developed to evaluate the chance constraints in the context of evolutionary computation and several Pareto optimiza…
Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties
Xiankun Yan, Anh Viet Do, Feng Shi +2
Chance constraints are frequently used to limit the probability of constraint violations in real-world optimization problems where the constraints involve stochastic components. We…
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
Feng Shi, Daoyu Huang, Xiankun Yan +1
The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing…