基于探路者算法的绿色有限缓冲区流水线调度  

Pathfinder Algorithm for Green Pipeline Scheduling with Limited Buffers

作　　者：胡蓉[1] 董钰明 钱斌[1] Hu Rong;Dong Yuming;Qian Bin(Kunming University of Science and Technology,Faculty of Information Engineering and Automation,Kunming 650500,China)

机构地区：[1]昆明理工大学信息工程与自动化学院,云南昆明650500

出　　处：《系统仿真学报》2021年第6期1384-1396,共13页Journal of System Simulation

基　　金：国家自然科学基金资助项目(61963022,51665025)。

摘　　要：针对带能耗阈值约束和有限缓冲区的绿色流水车间调度问题(Green Flow Shop Scheduling Problemwith Limited Buffers and Energy Thresholds,GFSSPLBET),提出一种混合探路者算法(Hybrid Pathfinder Algorithm,HPFA)进行求解,优化目标为总能量消耗和最大完工时间。为增强算法的全局搜索能力,设计基于距离的选择机制确定每个探路者对应的跟随者,以确保各探路者的附近区域均能得到一定的搜索;设计融合多种邻域操作的自学习搜索策略,用于对更新后的探路者进行多邻域搜索,从而提升算法的局部开采能力。通过仿真实验表明所提改进措施能有效增强算法性能,也验证了HPFA求解GFSSPLBET的有效性和鲁棒性。A Hybrid Pathfinder Algorithm(HPFA) is proposed for solving the green flow shop scheduling problem with limited buffers and energy threshold constraints(GFSSPLBET). The optimization criteria are to minimize the total energy consumption and the makespan. In order to enhance the global search ability of HPFA, a distance-based selection scheme is designed to determine each pathfinder’s followers to ensure that the near regions of any pathfinder can get a certain search. A self-learning search strategy integrating multiple operations is designed to perform multi-neighborhood search on the updated pathfinders, which can improve the local exploitation ability of HPFA. Simulation experiments show that the presented improvement strategies can effectively enhance the performance of HPFA and also verify the effectiveness and robustness of HPFA for dealing with the GFSSPLBET.

关 键 词：混合探路者算法 有限缓冲区 流水车间调度问题 总能量消耗 能耗阈值约束 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]