In the above equation, the last two terms corresponds to the complexity of the archive stage. The fittest point in the archive (containing 2Imax points) is compared with the current P1, giving the computational equivalent of choosing the fittest point from 2Imax+1 points. Similarly, the updating of P2 involves the computational equivalent of choosing the fittest point from 2Imax points.