Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting
Niyaz Nigmatullin, Maxim Buzdalov, Andrey Stankevich · 2016
Many evolutionary multi-objective algorithms rely heavily on non-dominated sorting, the procedure of assigning ranks to individuals according to Pareto domination relation. The steady-state versions of these algorithms need efficient implementations of incremental non-dominated sorting, an algorithm or data structure which supports efficient addition of a new individual and deletion of the worst individual.