4.5 Article

A self-learning bee colony and genetic algorithm hybrid for cloud manufacturing services

期刊

COMPUTING
卷 104, 期 9, 页码 1977-2003

出版社

SPRINGER WIEN
DOI: 10.1007/s00607-022-01079-0

关键词

Cloud manufacturing; Reinforcement learning (RL); Service composition and optimization; Bee colony algorithm; Genetic algorithm; Quality of service

资金

  1. China Postdoctoral Science Foundation [2019M662410]
  2. Key Technologies Research and Development Program [2018AAA0101804]

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

The paper introduces a self-learning artificial bee colony genetic algorithm (SLABC-GA) based on reinforcement learning to solve cloud service composition and optimization (CSCO) problems, with faster speed, greater precision, and higher stability. The algorithm aims to avoid local optima and improve the precision of the traditional artificial bee colony algorithm (ABC), with a genetic algorithm (GA) introduced later for further accuracy and convergence speed enhancements. Through comparative experiments, the SLABC-GA outperforms GA and ABC in terms of accuracy and speed for large-scale CSCO problems.
At present, cloud services and cloud manufacturing are developing rapidly, speed and accuracy have become the themes of cloud manufacturing development. The core component of cloud manufacturing is resource portfolio optimization. In cloud manufacturing today, the scale of service portfolios is expanding rapidly, and the number of candidate services which in the service pool is increasing gradually. To adapt to the development of cloud services, an optimization algorithm with faster speed, greater precision and higher stability is required to solve the problem of cloud service composition and optimization (CSCO). To increase the convergence rate and avoid falling into local optima with the artificial bee colony algorithm, a self-learning artificial bee colony genetic algorithm (SLABC-GA) is proposed in this paper, which is based on reinforcement learning (RL), and the RL is used to intelligently select the number of dimensions of each update of a feasible solution. A global optimal individual is used to search and guide the search equation to avoid obtaining local optima and improve algorithm development and the precision of the traditional artificial bee colony algorithm (ABC). A genetic algorithm (GA) is introduced in a later stage of the algorithm to further improve its accuracy and convergence speed. Additionally, this paper analyzes and constructs the self-learning model in SLABC, the optimal learning method is Q-learning algorithm, and designs a reward method and state determination method of RL in the environment of the bee colony algorithm. Finally, a large number of comparative experiments have been carried out, the results show that the accuracy and speed of the SLABC-GA outperform for CSCO problems, and the performance of the SLABC-GA for large-scale CSCO problems is better than that of genetic algorithm (GA) and the traditional artificial bee colony algorithm (ABC).

作者

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

评论

主要评分

4.5
评分不足

次要评分

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

推荐

暂无数据
暂无数据