混合萤火虫算法求解多目标置换流水车间调度问题

Hybrid Firefly Algorithms for Multi-objective Permutation Flow Shop Scheduling Problem

  • 摘要: 针对多目标置换流水车间调度问题,提出一种基于萤火虫算法的混合算法.该混合算法以萤火虫算法为框架,利用NEH(Nawaz-Enscore-Ham)模型及机器编码方式初始化种群,保证在增加初始化种群多样性的同时提高初始种群质量;引入概率模型,用以记录工件间及工件与加工机器间的信息,同时利用概率矩阵中的信息组合区块,并利用区块组合人造解,用以提高算法的收敛速度及增加可行解的多样性;最后,为验证该混合算法的有效性,对OR-library中的Reeves案例集进行仿真测试,同时与其他相关智能算法进行求解性能比较,验证了该混合算法具有良好的求解性能.

     

    Abstract: To solve the multi-objective permutation flow shop scheduling problem, a hybrid algorithm based on the firefly algorithm is proposed. The hybrid algorithm considers the firefly algorithm as the framework, and the NEH model and machine coding are used to initialize the population, thereby ensuring the diversity of the initial population while improving the quality of the initial population. The information between workpieces and the information between workpieces and machines are captured by the probability matrix. In addition, the information in the probability matrix is used to combine blocks, and the blocks are used to improve the convergence speed and increase the diversity of feasible solutions. Simulation results of Reeves suites in OR-library and a comparison with other excellent algorithms validate the efficiency of the proposed algorithm.

     

/

返回文章
返回