In this current work, a new I is generated randomly within its bounds every time the algorithm proceeds to the archive stage, but variations to this can be explored to make it more adaptive. In its simplest form, I may be given a fixed static value, resulting in a two parameter (I and α) algorithm.