Dual-population algorithm for distributed permutation flowshop scheduling problem with variable processing speed
Aiming at the distributed permutation flowshop scheduling problem with variable processing speed,a du-al-population algorithm is proposed to optimize the makespan and the total energy consumption of the machine.First,an initialization method that mixes four strategies is used to generate a high-quality initial population.Second,specific evolution methods are designed according to the characteristics of the two populations,and the dynamic guide factor is introduced to adjust the evolution mode of the populations.Meanwhile,an energy-saving strategy for speed regulation is proposed to further optimize energy consumption.Finally,a dynamic population strategy is pro-posed to balance the resources of the two populations.Simulation results verify the effectiveness of each strategy,and show that the proposed dual population algorithm outperforms current multi-objective evolutionary algorithms.
万方数据
维普
