An analysis on recombination in multi-objective evolutionary optimization
From MaRDI portal
Publication:490439
DOI10.1016/j.artint.2013.09.002zbMath1334.68203MaRDI QIDQ490439
Chao Qian, Yang Yu, Zhi-Hua Zhou
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2013.09.002
computational complexity; multi-objective optimization; recombination; evolutionary algorithms; crossover; running time
68Q25: Analysis of algorithms and problem complexity
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Variable solution structure can be helpful in evolutionary optimization, Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II), On the effectiveness of immune inspired mutation operators in some discrete optimization problems, Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework, Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions, Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation, Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs, Optimizing group learning: an evolutionary computing approach, Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms, Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the approximation ability of evolutionary optimization with application to minimum set cover
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Minimum spanning trees made easier via multi-objective optimization
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- On the spanning trees of weighted graphs
- On spanning tree problems with multiple objectives
- On bicriterion minimal spanning trees: An approximation
- Evolutionary algorithms. The role of mutation and recombination
- On the analysis of the \((1+1)\) evolutionary algorithm
- The problem of the optimal biobjective spanning tree
- On the convergence of multiobjective evolutionary algorithms
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Real royal road functions -- where crossover provably is essential
- A new approach to estimating the expected first hitting time of evolutionary algorithms
- The multi-criteria minimum spanning tree problem based genetic algorithm
- The one-dimensional Ising model: mutation versus recombination
- Multicriteria Optimization
- Drift analysis and average time complexity of evolutionary algorithms