基于改进双种群遗传算法的多目标绿色柔性作业车间调度

    Multi-Objective Green Flexible Job Shop Scheduling Based on an Improved Dual-Population Genetic Algorithm

    • 摘要: 为使调度计划在不降低加工效率的情况下实现制造生产的降能减排,建立以最大完工时间、机器总能耗和总碳排放量为优化目标的多目标绿色柔性作业车间调度问题数学模型。传统双种群遗传算法在求解上述模型时,由于初始化解集差异化较小导致调度方案重复性高,为解决这一问题提出一种改进双种群遗传算法。首先,采用两段式编码简化算法流程,并提出一种多目标改进全局—局部—随机搜索初始化方法增加种群解集多样性,提出适应度种群分割方法划分种群。之后对两个种群分别进行进化操作,并在合并后进行种群择优以提高下一代种群质量。最后,采用归一化法综合评估,选出最优调度方案。通过改进Brandimarte数据集和实例数据对改进双种群遗传算法进行验证对比,结果表明,改进双种群遗传算法在求解多目标绿色柔性作业车间调度问题时具有较大的优势。

       

      Abstract: In order to achieve energy and emission reduction for scheduling plans in manufacturing without reducing processing efficiency, a mathematical model of the multi-objective green flexible job shop scheduling problem is established with the objectives of minimizing makespan, total energy consumption of machines and total carbon emissions. To address the problem that the traditional dual-population genetic algorithm tends to generate highly repetitive scheduling schemes due to the low diversity of the initial population when solving the model, an improved dual population genetic algorithm is proposed. Firstly, a two-stage coding strategy is adopted to simplify algorithm processes, and a multi-objective improved global-local-random search initialization method is proposed to increase the population diversity. Then, a fitness-based population segmentation method is developed to divide the population. Subsequently, evolutionary operations are carried out on the two populations separately, and population selection is conducted after merging to improve the quality of the next generation. Finally, a normalization method is adopted for comprehensive evaluation to select the optimal schedule. Comparative experiments on an improved Brandimarte dataset and a practical case show that the proposed algorithm has great advantages in solving the multi-objective green flexible job shop scheduling problem.

       

    /

    返回文章
    返回