自适应Jaya算法求解多目标柔性车间绿色调度问题

针对多目标柔性作业车间绿色调度问题(MO-FJGSP),建立优化目标为最大完工时间、机器总负荷和能耗最小的多目标数学模型,并设计一种基于Pareto最优解的自适应多目标Jaya算法(SAMO-Jaya)对该问题进行优化求解.算法采用两级实数编码方式实现工序排序与机器分配的编码表示,并设计一种转换机制实现将Jaya连续解...

Multi-objective flexible job shop green scheduling problem with self-adaptive Jaya algorithm

A mathematical model aiming at minimizing the makespan, total machine utilization and energy consumption is established according to the multi-objective flexible job shop green scheduling problem(MO-FJGSP). A self-adaptive multi-objective Jaya algorithm(SAMO-Jaya) based on Pareto optimal solution is designed to optimize the model. And two-level real number encoding is adopted to implement the coding scheme of processes'' sequences and machines'' assignment, then a transformation mechanism is designed to create a mapping between the continuous solution space of Jaya and the discrete solution space of flexible job-shop scheduling problem(FJSP). And then a hybrid strategy combining chaotic sequence and uniform distribution is raised to improve the quality and diversity of the initial populations. In addition, a self-adaptive population size adjusting method is embedded to improve the optimizing speed of the algorithm. By analyzing the solutions of 10 single-objective benchmarks and 3 multi-objective benchmarks solved by SAMO-Jaya and other 7 existing algorithms, the results show that SAMO-Jaya can solve the MO-FJGSP effectively.