Algorithm 1 PL

Input:        $L_{sorted}$–individuals sorted in descending order;        r–niche radius;        $\epsilon$–accuracy level;        $ph$–the fitness of global optima; Output:   S–a set of individuals identified as solutions  1:$S\leftarrow \varnothing$  2:while not reaching the end of $L_{sorted}$ do  3:   Get the next unprocessed $p\in L_{sorted}$;  4:   $\mathit{notNewNiche}\leftarrow$ False;  5:   if $ph-\mathit{fit}\left(p\right)\le \epsilon$ then  6:     for each $s\in S$ do  7:        if $\parallel s-p\parallel \le r$ then  8:            $\mathit{notNewNiche}\leftarrow$ True;  9:            break; 10:        end if 11:     end for 12:     if $\mathit{notNewNiche}==$ False then 13:        $S\leftarrow S\cup \left\{p\right\}$; 14:     end if 15:   end if 16:end while