An analysis on recombination in multi-objective evolutionary optimization
type: Item
instance of: scholarly article
title: An analysis on recombination in multi-objective evolutionary optimization
zbMATH Open document ID: 1334.68203
author: Chao Qian
author: Yang Yu
author: Zhi-Hua Zhou
published in: Artificial Intelligence
publication date: 2015-08-27T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6476307
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: recombination
zbMATH Keywords: crossover
zbMATH Keywords: running time
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.artint.2013.09.002
OpenAlex ID: W2015353056
cites work: On bicriterion minimal spanning trees: An approximation
cites work: Q4331755
cites work: The multi-criteria minimum spanning tree problem based genetic algorithm
cites work: Multi-objective optimization using evolutionary algorithms
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Multicriteria Optimization
cites work: The one-dimensional Ising model: mutation versus recombination
cites work: On spanning tree problems with multiple objectives
cites work: On the convergence of multiobjective evolutionary algorithms
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: The analysis of evolutionary algorithms -- A proof that crossover really can help
cites work: Real royal road functions -- where crossover provably is essential
cites work: On the spanning trees of weighted graphs
cites work: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
cites work: Minimum spanning trees made easier via multi-objective optimization
cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
cites work: The problem of the optimal biobjective spanning tree
cites work: Evolutionary algorithms. The role of mutation and recombination
cites work: Q3815146
cites work: Analysis of recombinative algorithms on a non-separable building-block problem
cites work: A new approach to estimating the expected first hitting time of evolutionary algorithms
cites work: On the approximation ability of evolutionary optimization with application to minimum set cover
cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem
DOI: 10.1016/J.ARTINT.2013.09.002
description: scientific article; zbMATH DE number 6476307