基于新型帝国竞争算法的高维多目标柔性作业车间调度

Novel imperialist competitive algorithm for many-objective flexible job shop scheduling

中文关键词  高维多目标优化  柔性作业车间调度  帝国竞争算法  低碳调度

英文关键词  many-objective optimization  flexible job shop scheduling problem  imperialist competitive algorithm  energy-efficient scheduling

中文摘要

      摘要：针对高维多目标柔性作业车间调度问题(MaOFJSP)，提出了一种新型帝国竞争算法(ICA)以同时最小化最大完成时间、最大拖期、最大机器负荷和总能耗，该算法采用新方法构建初始帝国使得大多数殖民国家分配数量相近的殖民地，引入殖民国家的同化，并应用新的革命策略和帝国竞争方法以获得高质量解。最后通过大量实验测试ICA新策略对其性能的影响并将ICA与其它算法对比，实验结果表明新型ICA在求解MaOFJSP方面具有较强的优势。

英文摘要

      Abstract: In this study many-objective flexible job shop scheduling problem (MaOFJSP) is investigated, the goal of which is to minimize makespan, maximum tardiness, maximum workload of machine and total energy consumption simultaneously. A novel imperialist competitive algorithm (ICA) is proposed, in which initial empires are newly constructed so that most of imperialists are assigned close number of colonies. Assimilation of imperialist is introduced, and revolution and imperialist competition are implemented in a new way, respectively, to produce high quality solutions. Extensive experiments are conducted to test the impact of strategies of ICA on its performance and compare ICA with other algorithms finally. The experimental results validate that ICA has a strong advantage for MaOFJSP.