Table 2 The computational complexities of CJSESOS and JS methods.
From: Bi-objective jellyfish algorithm for team formation problem
Aspect | CJSESOS | JS |
|---|---|---|
Initialization | \(\:O(N\cdot\:D)\) | \(\:O(N\cdot\:D)\) |
Fitness evaluation | \(\:O(N\cdot\:{C}_{f})\) | \(\:O(N\cdot\:{C}_{f})\) |
Chaotic sequence generation | \(\:O(N\cdot\:\:D)\) | Not applicable |
Position update/diversity mechanism | \(\:O\left(K\cdot\:\:D\right),\:\)via ESSO | \(\:O\left(N\cdot\:D\right),\:\)via swarm interactions |
Selection | \(\:O\left(N\text{log}N\right)\) | \(\:O\left(N\right)\) |
Total per generation | \(\:O(N\cdot\:{C}_{f}+N\cdot\:D+K\cdot\:D+N\cdot\:\text{log}N)\) | \(\:O(N\cdot\:{C}_{f}+N\cdot\:D)\), |
Total for T generations | \(\:O(G\cdot\:(N\cdot\:{C}_{f}+N\cdot\:D+K\cdot\:D+N\cdot\:\text{log}N\left)\right)\), | \(\:O(G\cdot\:(N\cdot\:{C}_{f}+N\cdot\:D\left)\right)\), |
