Algorithm Based on Improved Genetic Algorithm for Job Shop Scheduling Problem

摘要

Job Shop Scheduling Problem is a kind of typical optimization management problem. The majorities of this kind of problem is NP-hard problem, traditional genetic algorithm tends to fail into local optimal solution and the algorithm converges quickly. This paper proposed Niche Adaptive Genetic Algorithm, which uses niche technology to enhance the optimization ability of algorithm, uses adaptive mechanism to accelerate the convergence speed of the algorithm. Compared with genetic algorithm and niche genetic algorithm, the test results show that Niche Adaptive Genetic Algorithm can find a better solution and has a stronger robustness.