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...
Main Authors: | Lingling Xue, Peng Zeng, Haibin Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-09-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/10/19/6858 |
Similar Items
-
On Proper 2-Dominating Sets in Graphs
by: Paweł Bednarz, et al.
Published: (2024-03-01) -
Making a Dominating Set of a Graph Connected
by: Li Hengzhe, et al.
Published: (2018-11-01) -
Domination, Eternal Domination, and Clique Covering
by: Klostermeyer William F., et al.
Published: (2015-05-01) -
On minimum intersections of certain secondary dominating sets in graphs
by: Anna Kosiorowska, et al.
Published: (2023-07-01) -
On domination in signed graphs
by: Joseph James, et al.
Published: (2023-08-01)