Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts
type: Item
instance of: scholarly article
title: Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts
zbMATH Open document ID: 1329.90172
author: Yu Chen
author: Xiufen Zou
published in: Information Sciences
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6530464
zbMATH Keywords: runtime analysis
zbMATH Keywords: multi-objective evolutionary algorithm
zbMATH Keywords: finite approximations of Pareto fronts
describes a project that uses: MOEA/D
describes a project that uses: SPEA2
describes a project that uses: SMS-EMOA
MaRDI profile type: Publication
full work available at URL: j.ins.2013.11.023
OpenAlex ID: W2082372503
cites work: Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
cites work: SMS-EMOA: multiobjective selection based on dominated hypervolume
cites work: Convergence rates of SMS-EMOA on continuous bi-objective problem classes
cites work: Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front
cites work: Evolutionary Multi-Criterion Optimization
cites work: Illustration of fairness in evolutionary multi-objective optimization
cites work: Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems
cites work: A multiobjective evolutionary algorithm for approximating the efficient set
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
cites work: Palmprint identification using restricted fusion
cites work: A co-evolutionary multi-objective optimization algorithm based on direction vectors
cites work: Learning paradigm based on jumping genes: a general framework for enhancing exploration in evolutionary multiobjective optimization
cites work: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
cites work: Convergence of stochastic search algorithms to finite size Pareto set approximations
cites work: A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets
cites work: Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids
DOI: 10.1016/J.INS.2013.11.023
description: scientific article; zbMATH DE number 6530464