Affordable Access

Access to the full text

A dynamic ant-colony genetic algorithm for cloud service composition optimization

Authors
  • Yang, Yefeng
  • Yang, Bo
  • Wang, Shilong
  • Liu, Feng
  • Wang, Yankai
  • Shu, Xiao
Type
Published Article
Journal
The International Journal of Advanced Manufacturing Technology
Publisher
Springer London
Publication Date
Jan 03, 2019
Volume
102
Issue
1-4
Pages
355–368
Identifiers
DOI: 10.1007/s00170-018-03215-7
Source
Springer Nature
Keywords
License
Yellow

Abstract

At present, as the candidate services in the cloud service pool increase, the scale of the service composition increases rapidly. When the existing intelligent optimization algorithms are used to solve the large-scale cloud service composition and optimization (CSCO) problem, it is difficult to ensure the high precision and stability of the optimization results. To overcome such drawbacks, a new dynamic ant-colony genetic hybrid algorithm (DAAGA) is proposed in this paper. The best fusion evaluation strategy is used to determine the invoking timing of genetic and ant-colony algorithms, so the executive time of the two algorithms can be controlled dynamically based on the current solution quality, then the optimization ability is maximized and the overall convergence speed is accelerated. An iterative adjustment threshold is introduced to control the genetic operation and population size in later iterations, in which the effect of genetic algorithm is reduced when the population closes to optimal solution, only the mutation operation is implemented to reduce the calculation, and the population size is increased to find the optimal solution more quickly. A series of comparison experiments are carried out and the results show that the accuracy and stability of DAAGA are significantly improved for the large-scale CSCO problem, and the time consumption of the algorithm is also optimized.

Report this publication

Statistics

Seen <100 times