TY - JOUR
AU - Gao, Yan
AB - Abstract Service computing is a new paradigm and has been widely used in many fields. The multi-objective service selection is a basic problem in service computing and it is non-deterministic polynomial (NP)-hard. This paper proposes a novel multi-objective artificial bees colony (n-MOABC) algorithm to solve service selection problem. A composite service instance is a food source in the algorithm. The fitness of a food source is related to the quality of service (QoS) attributes of a composite service instance. The search strategy of the bees are based on dominance. If a food source has not been updated in successive maximum trial (Max Trial) times, it will be abandoned. In experiment phase, a parallel approach is used based on map-reduce framework for n-MOABC algorithm. The performance of the algorithm has been tested on a variety of data sets. The computational results demonstrate the effectiveness of our approach in comparison to a novel bi-ant colony optimization (NBACO) algorithm and co-evolution algorithm.
TI - Solving service selection problem based on a novel multi-objective artificial bees colony algorithm
JF - "Journal of Shanghai Jiaotong University (Science)"
DO - 10.1007/s12204-017-1860-2
DA - 2017-08-01
UR - https://www.deepdyve.com/lp/springer-journals/solving-service-selection-problem-based-on-a-novel-multi-objective-FCzs1Ob3Gl
SP - 474
EP - 480
VL - 22
IS - 4
DP - DeepDyve
ER -