Pseudocode for proposed NSCBO algorithm
1:	Assign the NSCBO parameters, namely NCB, archive set (A), and Imax
2:	/////////////////////////Initialization //////////////////////////
3:	for each CB i = 1 to NCB
4:	Initialize the position xi and velocity vi
5:	Calculate the fitness each objective of every CB F_objective(xi) using Eq. (29)
6:	Update the best CB in “A” non-dominated sorting procedure (see 3.3.2)
7:	Calculate the crowding distance for find the ranking of diverse layers using Eqs. 21 & 22
8:	end for
9:	While (k < I max)
10:	For i = 1:NCB
11:	Calculate the Mass of each CB using Eqs. 23 & 24
12:	Update the CB position using 28 & 29
13:	Calculate the fitness each objective of every CB F_objective(xi) using Eq. (29)
14:	Update the best CB in “A” non-dominated sorting procedure (see 3.3.2)
15:	Calculate the crowding distance for find the ranking of diverse layers using Eqs. 21 & 22
16:	End for
17:	Next generation until stopping criteria is satisfied the end while
18:	Find the BCS solution using Eqs. 27 & 28.