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>...

詳細記述

書誌詳細

主要な著者:	Lingling Xue, Peng Zeng, Haibin Yu
フォーマット:	Artigo
言語:	Inglês
出版事項:	MDPI AG 2020-09-01
シリーズ:	Applied Sciences
主題:	dominant set set theory SET-based non-dominated sorting algorithm (SETNDS), time complexity
オンライン･アクセス:	https://www.mdpi.com/2076-3417/10/19/6858
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!