{'fraction_non_alphanumeric': 0.018367346938775512, 'fraction_numerical': 0.0, 'mean_word_length': 4.987804878048781, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Hitting Time Analysis of OneMax Problem in Genetic Algorithm

Genetic algorithms (GAs) are stochastic optimization techniques, and we have studied the effects of stochastic fluctuation in the process of GA evolution. A mathematical study was carried out for GA on OneMax function within the framework of Markov chain model. We treated the task of estimating convergence time of the Markov chain for OneMax problem. Then, in order to study hitting time, we study the state after convergence.