论文部分内容阅读
针对柔性作业车间调度问题(FJSP)的特点,在基本入侵杂草优化算法原理的基础上,提出一种离散多种群入侵杂草优化算法.该算法引入多种群思想且在算法初期不进行种群交流,在各种群内采用交叉算子进行交流.当空间扩展时,采用自适应变异位数策略和领域搜索策略,提高了算法初期的全局搜索和后期的局部挖掘能力.在算法后期进行种群交流,提高了算法的收敛速度和寻优精度.将该算法用于柔性作业车间调度问题,且在解码时提出一种矩阵解码法.计算实例验证了所提出算法的有效性和优越性.
Aiming at the characteristics of the flexible job shop scheduling problem (FJSP), based on the principle of the basic invading weed optimization algorithm, a discrete multi-species intrusion weed optimization algorithm is proposed. The algorithm introduces multiple population ideas and does not exchange population at the beginning of the algorithm , Crossover operator is used to communicate in each group.When the space is expanded, adaptive mutation number strategy and domain search strategy are used to improve the initial global search and the latter part of local mining ability.At the end of the algorithm, , Which improves the convergence speed and accuracy of the algorithm.The algorithm is applied to the flexible job shop scheduling problem, and a matrix decoding method is proposed in the decoding process.Examples are given to verify the effectiveness and superiority of the proposed algorithm.