时间不确定的job shop问题的一种改进遗传算法

摘要

针对时间不确定的job shop调度问题,设计了一种基于机器编码的带有小生境排挤机制遗传算法.该算法引入了冲突消解机制,能迅速提高每一代种群中染色体的质量,加快染色体的进化速度.同时引入带有排挤机制的小生境遗传算法,维持了种群的多样性,有效避免了算法的早熟收敛.增强了算法的整体性能.给出的实例验证了算法的有效性.%A Machine Coded Niche Genetic Algorithm ( MNGA ) is designed for fuzzy time Job Shop Scheduling Problem ( JSSP ).The algorithm not only introduces the mechanism of conflict resolution, increasing the quality of chromosome in the population of every generation rapidly, and accelerating the speed of evolution of chromosomes. but also introduces the niche genetic algorithm with exclusion mechanism, maintains variety of population for avoiding premature. This algorithm strengthens the unitary capability of scheduling algorithm. Given example shows the effectiveness of the algorithm.