Algorithm 1. Pseudocode of TOA.
Start TOA.
1.	Input problem information: variables, objective function, and constraints.
2.	Set number of team members (N) and iterations (T).
3.	Generate an initial population matrix at random.
4.	Evaluate the objective function.
5.		For t = 1:T
6.			Update supervisor based on Equation (3).
7.				For i = 1:N
8.					Stage1: supervisor guidance
9.						Update$X_i$based on first stage using Equations (4) and (6).
10.					Stage2: information sharing
11.						Determine better team members and$N_i$for i’th team member.
12.						Calculate based on Equation (7).
13.						Update$X_i$based on second stage using Equations (8) and (9).
14.					Stage 3: individual activity
15.						Update$X_i$based on third stage using Equations (10) and (11).
16.				End For i = 1:N
17.			Save best quasi-optimal solution obtained with the TOA so far.
18.		End For t = 1:T
19.	Output best quasi-optimal solution obtained with the TOA.
End TOA.