求解分布式两阶段装配流水车间调度的帝国竞争-协作算法  

An imperialist competition and cooperation algorithm for distributed two-stage assembly flow shop scheduling

作　　者：陈雅玲 雷德明[1] CHEN Ya-ling;LEI De-ming(School of Automation,Wuhan University of Technology,Wuhan Hubei 430070,China)

机构地区：[1]武汉理工大学自动化学院,湖北武汉430070

出　　处：《控制理论与应用》2021年第12期1957-1967,共11页Control Theory & Applications

基　　金：国家自然科学基金项目(61573264,71471151)资助.

摘　　要：针对分布式两阶段装配流水车间调度问题(DTAFSP),提出了一种新型优化方法-帝国竞争-协作算法(ICCA)以最小化总延迟时间.该算法在帝国竞争算法基础上,结合历史进化数据,提出一种基于最强帝国搜索能力与最弱帝国计算资源之间自适应交换的帝国间协作方法,并给出一种新型帝国竞争策略,以提高算法搜索效率.进行了大量计算实验,计算结果验证了ICCA策略的合理性和有效性以及它在求解DTAFSP方面较强的搜索优势.To deal with distributed two-stage assembly flow shop scheduling problem(DTAFSP),a new optimziation method named imperialist competition and cooperation algorithm(ICCA)is proposed to minimize the total tardiness,which is constructed based on imperialist competitive algorithm.To improve search efficiency,the cooperation method between empires is proposed through the adaptive exchange of computing resources of the weakest empire and search capabilities of the strongest empire and the usage of historical data,a new imperialist competition is also presented.A large number of experiments are carried out between ICCA and other algorithms to test the effect of strategies of ICCA.The experimental results show that the strategies of ICCA are reasonable and effective and ICCA has strong advantages in solving DTAFSP.

关 键 词：帝国竞争算法 分布式调度 帝国协作 装配 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TH186[自动化与计算机技术—控制科学与工程]