{'fraction_non_alphanumeric': 0.014720314033366046, 'fraction_numerical': 0.0, 'mean_word_length': 5.538461538461538, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Developing GA-based hybrid approaches for a real-world mixed-integer scheduling problem

Many real-world scheduling problems are suited to a mixed-integer formulation. The solution of these problems involves the determination of the scheduling period. The solution procedure requires simultaneous consideration of these two types of variables. In recent years researchers have focused much attention on developing new hybrid approaches using modern heuristic and traditional exact methods. This paper proposes the development of a variety of hybrid approaches that combines heuristics and mathematical programming within a genetic algorithm (GA) framework for a real-world mixed integer scheduling problem, namely the generation levels for each generator in a power system for each scheduling interval. This paper investigates how the optimum or near optimum solution for the GS problem promising and show that the hybrid approach offers an effective alternative for solving the GS problem within a realistic timeframe.