Figure 7
The flowchart begins with the labeled oval “Start” in the top oval, which directs the process to the first step: “Initiate random Population (Soldiers)” and “Initiate algorithm parameters”. From here, the process proceeds to the next step, “Finding nearest soldier to each one”, and a “No” from this step leads to “Stopping Criteria met?”. Finding the nearest soldier to each one connects to the next step, “Calculating the cost of each soldier”. The process then proceeds to identify the “Dam equals index of damaged soldier, Vic equals index of victorious soldier”. The flowchart checks whether the fault of the damaged soldier, “Fault(X dot Dam) is less than the threshold?”. If the condition is yes, the flow proceeds to “Relocate X dot Dam based on Equation 49”, which further leads to “Fault (X dot Dam) equals Fault (X dot Dam) plus 1”.It is then looped to “Fault (X dot Vic) equals 0”. If the condition “Fault(X dot Dam) is less than the threshold?” is no, the next step is “Relocate X dot Dam based on Equation 46”, and then the process further leads to “Fault(X dot Dam) equals 0” followed by “Fault (X dot Vic) equals 0”. The next steps in the process include “Calculate the cost function of X dot Dam”, followed by “Shrink the search space by Equation 49 and Equation 50”, and “Calculate the velocity of each particle”. The flowchart then proceeds to “Moving all particles based on Equation 51”. Afterward, the process checks whether the stopping criteria have been met (“Stopping Criteria met?”). If the stopping criteria are met, the process moves to “Select the best particle as final solution”, and the process finally ends.The flowchart of the proposed algorithm (BRO-PSO). Source: Authors' own work