An Improved Genetic Algorithm of Web Services Composition with QOS

Article Preview

Abstract:

A web service composition method based on the adaptive genetic operator was proposed to deal with the issues of the lack of adaptability and the easy-premature phenomena in web services composition genetic algorithm. Adaptive crossover and mutation operator were designed according to the individual adaptability and evolution stage for enlarging local search range and increasing convergent speed. Moreover, use for reference the idea of taboo table in taboo search algorithm, we can inhibit the algorithm from converging to false optimal solution untimely; meanwhile, an evolution strategy was adopted to prevent the loss of composite service with high fitness value. The experimental result shows that better composite services can be gotten through the improved algorithm; moreover the convergence speed has also been improved.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1836-1840

Citation:

Online since:

June 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Rojas I, Gonzalez J, Pomares H, Merelo J J, Castillo P A, Romero G, Statistical analysis of the main parameters involved in the design of a genetic algorithm, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2002, 32 (1) : 31 - 37.

DOI: 10.1109/tsmcc.2002.1009128

Google Scholar

[2] Ma Yue, Zhang Chengwen, Quick convergence of genetic algorithm for QoS-driven web service selection, Computer Networks, 2008, 52(5): 1093- 1104.

DOI: 10.1016/j.comnet.2007.12.003

Google Scholar

[3] Liang Wenyau, Huang Chunche, The generic genetic algorithm incorporates with rough set theory – An application of the web services composition, Expert Systems with Applications 2009, 36(3): 5549- 5556.

DOI: 10.1016/j.eswa.2008.06.084

Google Scholar

[4] Li Shuzhi, Yang Shuxing, Wang Jisheng, Web service selection based on genetic algorithm with tree dual-structure code, Computer Applications, 2008, 28(12) : 3017- 3020.

DOI: 10.3724/sp.j.1087.2008.03017

Google Scholar

[5] Liu Feng, Lei Zhenming, Research on user-aware QoS based Web services composition, The Journal of China Universities of Posts and Telecommunications, 2009, 16(5): 125- 130.

DOI: 10.1016/s1005-8885(08)60279-4

Google Scholar

[6] Ek Pengchew, Chong JinOng, Kim Heelim, Variable period adaptive genetic algorithm, Computers&Industrial Engineering, 2002, 42(2-4), 353-360.

Google Scholar

[7] Dong Zongran, Li Yingqiu, Chen Minghua, Web services composition optimization based on tabu search algorithm, Computer Engineering and Design, 2010, 31 (5): 942-945.

Google Scholar

[8] Yue Kun, Wang Xiaoling, Zhou Aoying, Underlying Techniques for Web Services: A Survey, Journal of Software, 2004, 15(3): 0428-0442.

DOI: 10.1109/icws.2004.1314760

Google Scholar