Application of a Reinforcement Learning-Based Improved Genetic Algorithm in Flexible Job-Shop Scheduling Problems

This paper addresses the limitations of genetic algorithms in solving the Flexible Job-Shop Scheduling Problem (FJSP) including slow convergence, susceptibility to local optima, and sensitivity to parameter settings. The paper proposes an Improved Genetic Algorithm based on Reinforcement Learning (IGARL). First, a hybrid population selection mechanism that combines the Queen Bee Mating Flight (QBMF) strategy with the Tournament Selection (TS) method is introduced. This mechanism significantly accelerates convergence by optimizing the population structure. Second, a dynamic population update strategy based on tunnel vision, termed the Solution Space Diversity Awakening (SSDA) strategy, is developed. When the population becomes trapped in local optima, this strategy intelligently triggers random perturbations and introduces high-potential individuals to enhance the algorithm’s ability to escape local optima and promote population diversity. Third, a novel multi-Q-table reinforcement learning framework is embedded within the iterative process to dynamically adjust key genetic algorithm parameters (such as selection, mutation, and crossover rates) and enable multi-dimensional performance evaluation, thereby effectively guiding the search toward better solutions. Experimental results demonstrate that the IGARL algorithm achieves a 10% to 60% improvement in convergence speed on Brandimarte benchmark instances, with solution quality significantly surpassing that of the basic genetic algorithm. Moreover, the fluctuation of the average optimal solution remains within 20%, indicating strong stability and robustness.