4.7 Article

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

期刊

INFORMATION SCIENCES
卷 456, 期 -, 页码 50-82

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.05.009

关键词

Cloud manufacturing; Many-objective optimization; Evolutionary algorithm; Service composition

资金

  1. National Natural Science Foundation of China [51675186, 51175187]
  2. Science & Technology Foundation of Guangdong Province [2017A030223002]
  3. China Scholarship Council (CSC)
  4. Excellent Doctoral Dissertation Innovation Fund of South China University of Technology (SCUT)

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据