Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Effective 2-and 3-objective MOEA/D approaches for the chance constrained knapsack problem
Optimizing real-world problems often involves decision-making under uncertainty due to the
presence of unknown or uncontrollable variables. Chance-constraints allow to model the …
presence of unknown or uncontrollable variables. Chance-constraints allow to model the …
Multi-objective evolutionary algorithms with sliding window selection for the dynamic chance-constrained knapsack problem
Evolutionary algorithms are particularly effective for optimisation problems with dynamic and
stochastic components. We propose multi-objective evolutionary approaches for the …
stochastic components. We propose multi-objective evolutionary approaches for the …
Using 3-objective evolutionary algorithms for the dynamic chance constrained knapsack problem
Real-world optimization problems often involve stochastic and dynamic components.
Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt …
Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt …
Analysis of evolutionary diversity optimization for permutation problems
Generating diverse populations of high-quality solutions has gained interest as a promising
extension to the traditional optimization tasks. This work contributes to this line of research …
extension to the traditional optimization tasks. This work contributes to this line of research …
The chance constrained travelling thief problem: Problem formulations and algorithms
The travelling thief problem (TTP) is a multi-component combinatorial optimization problem
that has gained significant attention in the evolutionary computation and heuristic search …
that has gained significant attention in the evolutionary computation and heuristic search …
Diversity optimization for the detection and concealment of spatially defined communication networks
In recent years, computing diverse sets of high quality solutions for an optimization problem
has become an important topic. The goal of computing diverse sets of high quality solutions …
has become an important topic. The goal of computing diverse sets of high quality solutions …
Evolving reliable differentiating constraints for the chance-constrained maximum coverage problem
Chance-constrained problems involve stochastic components in the constraints which can
be violated with a small probability. We investigate the impact of different types of chance …
be violated with a small probability. We investigate the impact of different types of chance …
Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multiobjective Algorithms
Many real-world optimization problems can be stated in terms of submodular functions.
Furthermore, these real-world problems often involve uncertainties which may lead to the …
Furthermore, these real-world problems often involve uncertainties which may lead to the …
Sampling-based Pareto optimization for chance-constrained monotone submodular problems
Recently surrogate functions based on the tail inequalities were developed to evaluate the
chance constraints in the context of evolutionary computation and several Pareto …
chance constraints in the context of evolutionary computation and several Pareto …
On the use of quality diversity algorithms for the travelling thief problem
In real-world optimisation, it is common to face several sub-problems interacting and forming
the main problem. There is an inter-dependency between the sub-problems, making it …
the main problem. There is an inter-dependency between the sub-problems, making it …