Multiple service processes optimization with slack temporal constraints based on cooperative coevolution algorithm

被引：0

作者：

School of Computer Science & Technology, Soochow University, Suzhou ^{[1
]}

215006, China

不详 ^{[2
]}

100083, China

机构：

[1] School of Computer Science & Technology, Soochow University, Suzhou

[2] School of Mechanical Engineering, University of Science and Technology Beijing, Beijing

来源：

Jisuanji Jicheng Zhizao Xitong | / 8卷 / 2213-2227期

基金：

中国国家自然科学基金;

关键词：

Cooperative coevolution; Non-uniform probability; Quality of service; Service processes; Temporal constraints;

D O I：

10.13196/j.cims.2015.08.027

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

To meet the requirements of complex service processes application, an optimization approach for multiple processes with slack temporal constraints was proposed. A formal model for multi-processes optimization with slack temporal constraints was designed, and the satisfaction principle on slack temporal constraints was defined, which could lay a foundation for the temporal verification and process optimization. Aiming at the problems of large-scale searching and slack temporal coordination between different processes, a Non-uniform based Hybrid Cooperative Coevolution (NHCC) algorithm was proposed to solve the problem. By referencing Potter's cooperative coevolution framework, some improved strategies such as sub-population evolution based on pheromone crossing, sub-populations collaboration based on non-uniform probability and elite sub-individuals migration were designed to increase the searching efficiency and population diversity. Several experiments were executed and the results showed the effectiveness and advantage of proposed method in both speed and accuracy. ©, 2015, CIMS. All right reserved.

引用

页码：2213 / 2227

页数：14

共 23 条

[1]

Huhns M., Singh M., Service-oriented computing: key concepts and principles, IEEE Internet Computing, 9, 1, pp. 75-81, (2005)

[2]

Stephen L., Ita R., Process models for service-based applications: a systematic literature review, Information & Software Technology, 53, 1, pp. 424-439, (2011)

[3]

Xu H., Du Y., Dong S., Study on the compatibility and modification of Web service composition with temporal constraints, Computer Integrated Manufacturing Systems, 18, 11, pp. 2561-2572, (2012)

[4]

Liu X., Yang Y., Jiang Y., Et al., Preventing temporal violations in scientific workflows: where and how, IEEE Transactions on Software Engineering, 37, 6, pp. 805-825, (2011)

[5]

Ardagna D., Pernici B., Adaptive service composition in flexible processes, IEEE Transactions on Software Engineering, 33, 6, pp. 369-384, (2007)

[6]

Rosenberg F., Muller M., Leitner P., Et al., Metaheuristic optimization of large-scale QoS-aware service compositions, Proceedings of IEEE International Conference on Services Computing, pp. 97-104, (2010)

[7]

Yu J., Buyya R., Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms, Scientific Programming, 14, 3, pp. 217-230, (2006)

[8]

Medjahed B., Bouguettaya A., A dynamic foundational architecture for semantic Web services, Distributed and Parallel Databases, 17, 2, pp. 179-206, (2005)

[9]

Palanikkumar D., Kathiravan M., An algorithmic evaluation of optimal service selection using BCO, European Journal of Scientific Research, 68, 4, pp. 591-605, (2012)

[10]

Chen W., Zhang J., An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 39, 1, pp. 29-43, (2009)

← 1 2 3 →