首页> 外文期刊>Information Sciences: An International Journal >An adaptive multi-population differential artificial bee colony algorithm for many-objective service composition in cloud manufacturing
【24h】

An adaptive multi-population differential artificial bee colony algorithm for many-objective service composition in cloud manufacturing

机译:云制造中多目标服务组合的自适应多人差分人工蜂殖民地算法

获取原文
获取原文并翻译 | 示例
       

摘要

Several conflicting criteria must be optimized simultaneously during the service composition and optimal selection (SCOS) in cloud manufacturing, among which tradeoff optimization regarding the quality of the composite services is a key issue in successful implementation of manufacturing tasks. This study improves the artificial bee colony (ABC) algorithm by introducing a synergetic mechanism for food source perturbation, a new diversity maintenance strategy, and a novel computing resources allocation scheme to handle complicated many-objective SCOS problems. Specifically, differential evolution (DE) operators with distinct search behaviors are integrated into the ABC updating equation to enhance the level of information exchange between the foraging bees, and the control parameters for reproduction operators are adapted independently. Meanwhile, a scalarization based approach with active diversity promotion is used to enhance the selection pressure. In this proposal, multiple size adjustable subpopulations evolve with distinct reproduction operators according to the utility of the generating offspring so that more computational resources will be allocated to the better performing reproduction operators. Experiments for addressing benchmark test instances and SCOS problems indicate that the proposed algorithm has a competitive performance and scalability behavior compared with contesting algorithms. (C) 2018 Elsevier Inc. All rights reserved.
机译:在云制造中的服务组合和最佳选择(SCOS)期间,必须同时优化几个冲突标准,其中关于复合服务质量的权衡优化是成功实施制造任务的关键问题。本研究通过引入食品源扰动,新的多样性维护策略和新颖的计算资源分配方案来改善人工蜂殖民地(ABC)算法,以处理复杂的许多客观SCOS问题。具体地,具有不同搜索行为的差分演进(DE)运营商被集成到ABC更新方程中,以增强觅食蜜蜂之间的信息交换水平,并且再现操作员的控制参数独立地进行调整。同时,使用基于具有主动分集促进的标准方法来增强选择压力。在该提议中,根据生成后代的效用,多个尺寸可调亚步骤随着不同的再现运营商而发展,从而将更多的计算资源分配给更好的执行再现运算符。寻址基准测试实例和SCOS问题的实验表明,与竞争算法相比,该算法具有竞争性能和可扩展性行为。 (c)2018年Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号