Abstract
Study of fluctuation in genetic algorithm has been a sub-objective in genetic algorithm implementations. The reliability of genetic algorithm may vary based on implementation case, hence it is necessary to investigate its performance pattern for each implementation case. The purpose of this study is to observe the reliability of genetic algorithm in our previously simulated network optimization in a data centre. Our findings agree with the nature of genetic algorithm and other previous researchers, where it is found that the fluctuation of fitness values in our case happened randomly in general, but it had higher probability with small population sizes. However, regardless of fluctuations that in average occurred during early stage of population generation, the optimal solutions with near-maximum fitness values were able to be generated. This fact has proven the robustness of genetic algorithm itself. Alongside the fluctuation studies, this paper also presents the results of standard deviation and 95% confidence interval calculations towards the true mean of best solutions’ fitness values. The computed standard deviations reflect the consistency of the adjusted GA properties in finding the best optimal solutions when run repeatedly. Afterward, it is also concluded from the confidence intervals analysis that 95% of the time, the fitness values of the discovered solutions, which represent multiple network cards’ optimal configurations will be between near-maximum fitness value of 100 Mbps. Thus, our methodology to improve data centre’s network, through simultaneous multiple network cards optimization can be expected to be highly achieving.
Get full access to this article
View all access options for this article.
