A novel hybrid algorithm for large-scale composition optimization problems in cloud manufacturing

Abstract

ABSTRACT At present, with the emergence and development of cloud manufacturing (CMfg), the scale of services in CMfg platforms increases rapidly which provide the same or familiar functionality but different performance. Large-scale cloud service composition and optimization (CSCO) problems is one of the key issues for the implementation of CMfg. To deal with this NP-hard problem, a novel hybrid algorithm called Bee-Colony Simplex method hybrid Algorithm (ABCSA) for CSCO problems is proposed in this paper, which employs both the Simplex method and chaotic and global best guided strategy. The random-evolve Simplex method is proposed to maintain the algorithm work efficiently to keep the population diversity and avoid premature convergence. The global best guided and chaos searching strategy is proposed to avoid local optimization. To evaluate the effectiveness and efficiency, simulation and analysis of the experiments are carried out, and the results clearly prove the superior performance of ABCSA over existing intelligent optimization algorithms in the CSCO problems.