Algorithm 1. Binary Novel External Archive.

Input: Candidate solutions (x), Objective function (f)

Output: Binary Novel External Archive

Initialize Flag = 0; $\mathrm{{\rm Y}}=0$

if ( $iter=1$) do

$Arh\leftarrow x_{best}$

end if

$\mathrm{\forall }i\in pop$ do

$\mathrm{\forall }k\in Arh$ do

if ( $HD\left(f\left(x_i\right),f\left(x_{best}\right)\right)>0$) then

$\mathrm{\forall }j\in D$ do

if $\left(x_{i,j}\ne x_{k,j}\right)$ then

$\mathrm{{\rm Y}}\leftarrow \mathrm{{\rm Y}}+1$

end if

end for

end if

if $\left({\rm Y}\ge \frac{D+1}{2}\right)$ then

Flag=1

$exit()$

end if

end for

if $\left(Flag\ne 1\right),$ then

$Arh\leftarrow Arh\oplus x_i$

Flag=0

end if

end for