Stochastic population update can provably be helpful in multi-objective evolutionary algorithms

DOI10.1016/J.ARTINT.2025.104308MaRDI QIDQ6995434zbMATH OpenFDO

Authors Chao Bian, Miqing Li, Chao Qian

Publication date 22 April 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2025.104308

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A Remark on Stirling's Formula
• An analysis on recombination in multi-objective evolutionary optimization
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
• Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
• Drift analysis and average time complexity of evolutionary algorithms
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Evolutionary learning: advances in theories and algorithms
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Exponential upper bounds for the runtime of randomized search heuristics
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Illustration of fairness in evolutionary multi-objective optimization
• Introduction to evolutionary computing
• Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments
• Multi-objective optimization using evolutionary algorithms
• Pareto optimization for subset selection with dynamic cost constraints
• Plateaus can be harder in multi-objective optimization
• Population size matters: rigorous runtime results for maximizing the hypervolume indicator
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• SMS-EMOA: multiobjective selection based on dominated hypervolume

This page was built for publication: Stochastic population update can provably be helpful in multi-objective evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995434)