引用本文:陈雅玲,雷德明.求解分布式两阶段装配流水车间调度的帝国竞争–协作算法[J].控制理论与应用,2021,38(12):1957~1967.[点击复制]
CHEN Ya-ling,LEI De-ming.An imperialist competition and cooperation algorithm for distributed two-stage assembly flow shop scheduling[J].Control Theory and Technology,2021,38(12):1957~1967.[点击复制]
求解分布式两阶段装配流水车间调度的帝国竞争–协作算法
An imperialist competition and cooperation algorithm for distributed two-stage assembly flow shop scheduling
摘要点击 1432  全文点击 467  投稿时间:2020-11-12  修订日期:2021-01-31
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  10.7641/CTA.2021.00796
  2021,38(12):1957-1967
中文关键词  帝国竞争算法  分布式调度  帝国协作  装配
英文关键词  imperialist competitive algorithm  distributed scheduling  empire cooperation  assembly
基金项目  国家自然科学基金项目(61573264, 71471151)资助.
作者单位E-mail
陈雅玲 武汉理工大学 chenyaling2020@126.com 
雷德明* 武汉理工大学 deminglei11@163.com 
中文摘要
      针对分布式两阶段装配流水车间调度问题(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.