Research Article
Binary Equilibrium Optimization Algorithm for Computing Connected Domination Metric Dimension Problem
| Algorithms | Parameter name | Value |
| BEOA | Particles numbers | 50 | Max iteration | 300 | a1, a2, GP, | [2, 1, 0.5, [0–1]] | Number of runs | 20 |
| BGWO | Search agents | 50 | Max iteration | 300 | a1, a2 | [2, 0] | Number of runs | 20 |
| BPSO | Swarm size | 50 | C1 | Increases linearly from 0.5 to 2.5 | C2 | Decreases linearly from 2.5 to 0.5 | Inertia weight () | 0.8 | Max iteration | 300 | Number of runs | 20 |
| BWOA | Population size | 50 | a1 | [2, 0] | a2 | −2, 1] | b | 1 | Max iteration | 300 | Number of runs | 20 |
| BSMA | Population size | 50 | z | 0.03 | Max iteration | 300 | Number of runs | 20 |
| BGOA | Population size | 50 | GMaX | 1 | GMin | 0.004 | Max iteration | 300 | Number of runs | 20 |
| BAEO | Population size | 50 | r1,r2, and r | rand | Max iteration | 300 | Number of runs | 20 |
| BEHO | Elephants number | 50 | Clans number | 5 | Kept elephants number | 2 | The scale factor α | 0.5 | The scale factor β | 0.1 | Max iteration | 300 | Number of runs | 20 |
|
|