𝑂(𝐵𝑂𝐴)=𝑂(𝑛𝑑)+𝑂(𝑇𝑚𝑎𝑥)𝑂(𝑛2log𝑛+𝑛+𝑛𝑑)OBOA=Ond+OTmaxOn2logn+n+nd (19) 3.2.2. Space Complexity The space complexity of an algorithm is regarded as the storage space consumed by the algorithm. The population size is n and the dimension...
The HPSBA population state space’s general state has a transition probability of one to the optimal state, that is, lim𝑡→∞𝑃(𝑡)(𝜁𝑖→𝜁𝑗)=1limt→∞P(t)(ζi→ζj)=1. Proof. Assuming the population state 𝜁(𝑗)ζ(j) is the optimal solution, if the algorithm...