Complexity of combinatorial ordering genetic algorithms COFFGA and CONFGA

This paper analyses the complexity of two Algorithms called COFFGA (Combinatorial Ordering First Fit Genetic Algorithm) and CONFGA (Combinatorial Ordering Next Fit Genetic Algorithm). It also identifies the parameters that affect the performance of these algorithms. The complexity of the GA depends on the problem being solved by this GA, as well as the operators of the GA itself. The complexity of COFFGA and CONFGA are analysed individually. Even of these algorithms are slightly different, they may have extremely different complexities depending on the differences in their fitness function or termination condition. To provide a provable bound on a problem, there must be a bound on the evaluation function as well as a manner by which the underlying problem is tied to the representation. Given that there is no standard complexity of the GA, and the complexity of any GA depends on the problem that being solved by this GA and its operators, then CONFGA and COFFGA are analysed with different complexities; although they built upon the same algorithm and they are used to solve the same problem (Cloud resource allocation problem), but they are different in their operators their fitness function and termination condition.