基于新型人工蜂群算法的分布式不相关并行机调度

New artificial bee colony for distributed unrelated parallel machine scheduling

中文关键词  预防性维修  人工蜂群算法  调度  种群划分

英文关键词  preventive maintenance  artificial bee colony algorithm  scheduling  colony division

中文摘要

      针对考虑预防性维修的分布式不相关并行机调度问题, 提出了一种新型人工蜂群算法(ABC)以最小化最大 完成时间. 为了获得高质量的计算结果, 该算法将整个种群划分为1个引领蜂群和3个跟随蜂群, 跟随蜂有自己的蜜 源且采用新方式跟随引领蜂, 4种蜂群运用彼此各异的搜索策略产生新解以增强种群多样性, 提出一种新策略处理 侦查蜂的搜索, 并利用优化数据更新整个种群. 通过大量仿真实验验证了新型ABC在求解所研究问题方面的有效 性和优势.

英文摘要

      To deal with the distributed unrelated parallel machines scheduling problem (DUPMSP) with preventive maintenance (PM), a new artificial bee colony (ABC) algorithm is proposed to minimize the maximum completion time. To obtain new solutions with high quality, the whole population is divided into one employed bee colony and three onlooker bee colonies. Each onlooker bee has its own food source and selects an employed bee using a novel way. In order to intensify the diversity of the whole population, different search strategies are adopted in four bee colonies to generate new solutions. A novel method is proposed to deal with the search of scout and the whole population is updated by using optimization data obtained in the search process of ABC. A number of simulation experiments are conducted on a set of instances to test the performance of the new ABC. The computational results demonstrate that the new ABC is effective and efficient to solve the considered DUPMSP with PM.