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

Tools

Zhou, Jiajun and Yao, Xifan and Lin, Yingzi and Chan, Felix T.S. and Li, Yun (2018) An adaptive multi-population differential artificial bee colony algorithm for many-objective service composition in cloud manufacturing. Information Sciences, 456. pp. 50-82. ISSN 0020-0255 (https://doi.org/10.1016/j.ins.2018.05.009)

[thumbnail of Zhou-etal-IS2018-An-adaptive-multi-population-differential-artificial-bee-colony]
Preview
 Text. Filename: Zhou_etal_IS2018_An_adaptive_multi_population_differential_artificial_bee_colony.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (3MB)| Preview

Abstract

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.

ORCID iDs

Zhou, Jiajun, Yao, Xifan, Lin, Yingzi, Chan, Felix T.S. and Li, Yun ORCID logoORCID: https://orcid.org/0000-0002-6575-1839;
CORE (COnnecting REpositories)