Table 9 Comparison of the SP and extreme solutions for the gear train problem.
From: NSCSO: a novel multi-objective non-dominated sorting chicken swarm optimization algorithm
Algorithm | SP | Objective function | |
---|---|---|---|
 | \(f_{1}\) | \(f_{2}\) | |
MOSMA | 0.2905 | – | – |
 \(f_{1} \to \min\) | – | 6.00 × 10–08 | 39 |
 \(f_{2} \to \min\) | – | 7.32 × 10–01 | 12 |
MOSPO | 0.1573 | Â | Â |
 \(f_{1} \to \min\) | – | 2.65 × 10–09 | 40 |
 \(f_{2} \to \min\) | – | 7.32 × 10–01 | 12 |
NSCSO | 0.1126 | – | – |
 \(f_{1} \to \min\) | – | 8.70 × 10–11 | 32 |
 \(f_{2} \to \min\) | – | 7.32 × 10–01 | 12 |