An analysis on recombination in multi-objective evolutionary optimization
DOI10.1016/J.ARTINT.2013.09.002zbMATH Open1334.68203OpenAlexW2015353056MaRDI QIDQ490439FDOQ490439
Authors: 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
Recommendations
- A multiobjective evolutionary algorithm based on mixture Gaussian models
- Artificial Evolution
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
- Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
- Evolutionary Multi-Criterion Optimization
computational complexitycrossovermulti-objective optimizationrecombinationevolutionary algorithmsrunning time
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Multi-objective optimization using evolutionary algorithms
- On the spanning trees of weighted graphs
- The one-dimensional Ising model: mutation versus recombination
- Drift analysis and average time complexity of evolutionary algorithms
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- On spanning tree problems with multiple objectives
- On the convergence of multiobjective evolutionary algorithms
- The problem of the optimal biobjective spanning tree
- Real royal road functions -- where crossover provably is essential
- Minimum spanning trees made easier via multi-objective optimization
- On the analysis of the \((1+1)\) evolutionary algorithm
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- A new approach to estimating the expected first hitting time of evolutionary algorithms
- On the approximation ability of evolutionary optimization with application to minimum set cover
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
- On bicriterion minimal spanning trees: An approximation
- Evolutionary algorithms. The role of mutation and recombination
- The multi-criteria minimum spanning tree problem based genetic algorithm
- Analysis of recombinative algorithms on a non-separable building-block problem
Cited In (14)
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs
- Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
- A unifying view on recombination spaces and abstract convex evolutionary search
- Variable solution structure can be helpful in evolutionary optimization
- Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
- Optimizing group learning: an evolutionary computing approach
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
- Artificial Evolution
- A multiobjective evolutionary algorithm based on mixture Gaussian models
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
This page was built for publication: An analysis on recombination in multi-objective evolutionary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490439)
