Algorithm 1: Proposed approach for generating new offspring
Notations:
NOR	Number of rows in a solution ($\mathit{nor}=1,2,\cdots ,NOR)$.
${\mathit{E}\mathit{F}\mathit{B}\mathit{S}}_{\mathit{n}\mathit{o}\mathit{r}}$	The ${\mathit{nor}}^{\mathit{th}}$ element on the first random binary string.
${\mathit{E}\mathit{S}\mathit{B}\mathit{S}}_{\mathit{n}\mathit{o}\mathit{r}}$	The ${\mathit{nor}}^{\mathit{th}}$ element on the second random binary string.
${\mathit{F}\mathit{S}\mathit{S}}_{\mathit{n}\mathit{o}\mathit{r}}$	The ${\mathit{nor}}^{\mathit{th}}$ row of the first selected solution.
${\mathit{S}\mathit{S}\mathit{S}}_{\mathit{n}\mathit{o}\mathit{r}}$	The ${\mathit{nor}}^{\mathit{th}}$ row of the second selected solution.
${\mathit{F}\mathit{O}\mathit{F}\mathit{S}}_{\mathit{n}\mathit{o}\mathit{r}}$	The ${\mathit{nor}}^{\mathit{th}}$ row of the first offspring.
${\mathit{S}\mathit{O}\mathit{F}\mathit{S}}_{\mathit{n}\mathit{o}\mathit{r}}$	The ${\mathit{nor}}^{\mathit{th}}$ row of the second offspring.
1.	Generate two random binary strings;
2.	For$\mathit{nor}=1$toNORdo
3.	If${\mathit{EFBS}}_{\mathit{nor}}=1$do
4.	${\mathit{FOFS}}_{\mathit{nor}}\leftarrow {\mathit{FSS}}_{\mathit{nor}};$
5.	Else
6.	${\mathit{FOFS}}_{\mathit{nor}}\leftarrow {\mathit{SSS}}_{\mathit{nor}};$
7.	End if
8.	If${\mathit{ESBS}}_{\mathit{nor}}=1$do
9.	${\mathit{SOFS}}_{\mathit{nor}}\leftarrow {\mathit{SSS}}_{\mathit{nor}};$
10.	Else
11.	${\mathit{SOFS}}_{\mathit{nor}}\leftarrow {\mathit{FSS}}_{\mathit{nor}};$
12.	End if
13.	End for
14.	Update the archive set with the newly generated offspring;
15.	Eliminate the dominated solutions from the archive set;
	Output: An updated archive set.