一种基于改进NSGA-II的多目标绿色柔性作业车间调度方法

A multi-objective green flexible job shop scheduling method based on improved NSGA-II algorithm

  • 摘要: 针对多目标绿色柔性作业车间调度问题,建立了以最小化最大完工时间、总负荷和总能耗为优化目标的多目标优化模型,提出了一种带有自适应交叉变异算子和学习机制的改进NSGA-II多目标优化算法。该算法通过机器和工序的两级编码机制,使用基于全局、局部和随机选择的非支配排序选择策略得到初始种群;采用具有自适应算子的混合交叉变异策略进行迭代,提高算法的全局搜索能力;引入分布函数来改进精英保留策略提高种群的多样性;通过学习机制进行邻域搜索提高算法的局部搜索能力。最后,采用基准测试算例Brandimarte以及Kacem数据集对算法进行测试,结果表明采用改进的NSGA-II算法求解多目标绿色柔性作业车间调度问题具有求解精度高、收敛速度快以及解集多样性好的优点。

     

    Abstract: For the multi-objective green flexible job shop scheduling problem, a multi-objective optimization model with minimizing the maximum completion time, total load and total energy consumption as objectives is established, and an improved NSGA-II multi-objective optimization algorithm with adaptive crossover mutation operator and learning mechanism is proposed. In this algorithm, the initial population is obtained by the non-dominated sorting selection strategy based on global, local and random selection through a two-level coding mechanism of machine and process. Hybrid crossover mutation strategy with adaptive operator is adopted to improve the global search performance of the algorithm. A distribution function is introduced to improve the elite preserving strategy and the diversity of population. Neighborhood search is carried out by learning mechanism to improve the local search capability of the algorithm. Finally, Brandimarte and Kacem data sets are used to test the algorithm. The results show that the improved NSGA-II algorithm for solving multi-objective green flexible job-shop scheduling problems has the advantages of high precision, fast convergence and good diversity of solution sets, which can guide the practical production decisions.

     

/

返回文章
返回