基于博弈人工蜂群算法的多目标车间调度研究  

Research on multi‐objective shop scheduling based on game artificial bee colony algorithm

作　　者：裴小兵[1] 王诗慧 PEI Xiaobing;WANG Shihui(School of Management,Tianjin University of Technology,Tianjin 300384,China)

机构地区：[1]天津理工大学管理学院,天津300384

出　　处：《武汉大学学报（工学版）》2023年第3期362-370,共9页Engineering Journal of Wuhan University

基　　金：国家创新方法工作专项项目(编号:2017IM010800)。

摘　　要：针对作业车间调度问题,以最大完工时间最小、机器的总空闲时间最小以及任务总延迟时间最小为目标,提出了博弈人工蜂群算法来求解多目标作业车间调度模型。为优化种群质量,应用改进的人工蜂群算法,通过设计交叉、变异以及局部搜索机制对种群进行不断优化;然后,通过博弈理论,使3个优化目标之间的博弈策略组成最优组合,从而获得子博弈精炼纳什均衡,求得问题的最优解;最后,进行了基准算例的仿真实验,并与其他算法进行比较,结果验证了所提算法的有效性。For the job-shop scheduling problem,the objectives of minimum completion time,minimum total machine idle time and minimum total task delay time,an game artificial bee colony algorithm is proposed to solve the multi-objective job-shop scheduling model.In order to optimize the population quality,the improved artificial bee colony algorithm is applied in the solution process,and the population is continuously optimized by designing crossover,mutation and local search mechanism.Then,through the game theory,the optimal combination of the game strategies among the three optimization objectives is achieved,so as to obtain the subgame refined Nash equilibrium and find the optimal solution of the problem.Finally,simulation experiments of benchmark calculation examples are carried out and compared with other algorithms,the results verify the effectiveness of the proposed algorithm.

关 键 词：作业车间调度 博弈论 子博弈精炼纳什均衡 人工蜂群算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]