{'fraction_non_alphanumeric': 0.026442307692307692, 'fraction_numerical': 0.001201923076923077, 'mean_word_length': 4.95, '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}}
A Minimal Bidding Application (with Slack Time) Solved by a Genetic Algorithm where Element Costs Are Time Dependent

Researchers Gargano and Edelson (1) have developed five theoretical models to study the use of Genetic Algorithms (GA’s) on optimal base models whereby the element costs are not fixed, but are time dependent. Here we consider the minimal Bidding problem. With the use of a Java program, we implement this problem using a GA to solve it. In addition, we focus on three objectives. First, we measure the sensitivity of Genetic Algorithms depending on variations in cost table. Next, we measure the sensitivity of Genetic Algorithms based on the size of the encoding. Finally, we measure the sensitivity of Genetic Algorithms depending on variations in population size verses generation size (size) and mutation rate.