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<br />fronts, is a key but time‐consuming process in multi‐objective evolutionary algorithms (MOEAs).<br />The best‐case and worst‐case time complexity of non‐dominated sorting algorithms currently<br...
Main Authors: | , , |
---|---|
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 |