基于混合离散状态转移算法的多目标节能无等待流水车间调度
Multi-objective Energy-efficient No-wait Flow Shop Scheduling Based on Hybrid Discrete State Transition Algorithm
王聪 1余佳英 1张宏立1
作者信息
- 1. 新疆大学 电气工程学院,新疆 乌鲁木齐 830047
- 折叠
摘要
针对以完工时间和总能耗为目标的节能无等待流水车间调度问题(energy-efficient no-wait flow shop scheduling problem,EENWFSP),设计一种混合离散状态转移算法(hybrid discrete state transition algorithm,HDSTA)进行求解.根据问题特性设计工序和速度矩阵的编码方式,采用启发式算法获得优质的初始解.根据EENWFSP性质,对4个离散操作算子进行任务分配,将嵌入二次状态转移的交换、移动、对称算子用于工序优化,替换算子用于机器速度优化,并在替换算子中嵌入基于关键路径的速度替换策略.设计了一种改进的破坏重构操作,用于进一步提高Pareto解的质量.通过与4种算法在测试实例上的实验结果分析,表明HDSTA在解决EENWFSP时具有较强优势.
Abstract
A hybrid discrete state transition algorithm(HDSTA)is designed to solve the energy-efficient no-wait flow shop scheduling problem(EENWFSP)minimizing makespan and total energy consumption.According to the characteristics of the problem,the coding method of job sequence and speed matrix is designed,and the heuristic algorithm is used to obtain the high-quality initial solution.According to the properties of EENWFSP,solving and allocating four discrete operators.The swap,shift and symmetry operators are embedded in secondary state transition are used for job sequence optimization,and the substitute operators are used for machine speed optimization.The speed substitute strategy based on critical path is embedded in the substitute operators.An improved destructive reconstruction operation is designed to further improve the quality of Pareto solution.Experimental results of four algorithms on test cases show that HDSTA has strong advantages in solving EENWFSP.
关键词
无等待流水车间/节能调度/状态转移算法/总能量消耗/最大完工时间/多目标优化Key words
no-wait flow shop scheduling problem/energy-efficient scheduling/state transition algorithm/total energy consumption/makespan/multi-objective optimization引用本文复制引用
基金项目
国家自然科学基金(52267010)
新疆维吾尔自治区自然科学基金(2022D01C367)
新疆维吾尔自治区自然科学基金(2022D01E33)
出版年
2024
NETL
NSTL
万方数据