SETNDS: A SET-Based Non-Dominated Sorting Algorithm for Multi-Objective Optimization Problems

Non-dominated sorting, used to find pareto solutions or assign solutions to different fronts, is a key but time-consuming process in multi-objective evolutionary algorithms (MOEAs). The best-case and worst-case time complexity of non-dominated sorting algorithms currently known are <i>O(MNlogN)</i>...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Lingling Xue, Peng Zeng, Haibin Yu
Formato:	Artigo
Idioma:	Inglês
Publicado em:	MDPI AG 2020-09-01
coleção:	Applied Sciences
Assuntos:	dominant set set theory SET-based non-dominated sorting algorithm (SETNDS), time complexity
Acesso em linha:	https://www.mdpi.com/2076-3417/10/19/6858
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!