Education, Science, Technology, Innovation and Life
Open Access
Sign In

Web service composition based on improved multi population genetic algorithm

Download as PDF

DOI: 10.23977/jwsa.2021.030102 | Downloads: 9 | Views: 1087

Author(s)

Siyuan Meng 1

Affiliation(s)

1 School of Computer Science of Technology, Shandong University of Technology, Zibo, 255000, China

Corresponding Author

Siyuan Meng

ABSTRACT

With the development of cloud computing, the improvement of web service standards and the progress of supporting software, more and more web services are published on the Internet. Web service quality aware (QoS) not only requires specific services to complete specific tasks, but also pays more attention to the comprehensive service quality of the whole web service composition. How to select the web service composition with the highest comprehensive QoS in the global is NP hard.In this paper, an improved two population genetic algorithm is proposed, in which a adaptive crossover operator is set in one population and a big mutation operator is set in another population to improve the existing genetic algorithm, so that the algorithm can balance the local search and global search ability.The experimental results show that this algorithm has the advantages of shorter time-consuming and higher accuracy than the general genetic algorithm and the multi-population genetic algorithm, and effectively avoids the defect of effective genes in the population.

KEYWORDS

Web service composition, multi-population genetic algorithm, QoS, big mutation operator

CITE THIS PAPER

Siyuan Meng, Web service composition based on improved multi population genetic algorithm. Journal of Web Systems and Applications (2021) 3: 7-14. DOI: http://dx.doi.org/10.23977/jwsa.2021.030102

REFERENCES

[1] Deng S, Zhaohui WU. A survey of Web service composition methods [J]. Sciencepaper Online, 2008.
[2] Chakraborty D, Perich F, Joshi A, et al. A Reactive Service Composition Architecture for Pervasive Computing Environments [J]. Ifip Advances in Information & Communication Technology, 2003, 106: 53-60.
[3] Chifu V R, Pop C B, Salomie I, et al. Optimizing the Semantic Web Service Composition Process Using Cuckoo Search [C]// Intelligent Distributed Computing V- International Symposium on Intelligent Distributed Computing-idc. DBLP, 2011.
[4] Liu B, Zhang R J. Web services composition method based on QoS by multiple objective optimization [J]. Computer Engineering and Design, 2012, 33 (3): 885-889.Ming C, Wang Z W. An Approach for Web Services Composition Based on QoS and Discrete Particle Swarm Optimization [C]// Eighth Acis International Conference on Software Engineering. IEEE Computer Society, 2007.
[5] Zhang L J, Bing L, Tian C, et al. On demand web services [J]. IEEE, 2003, 4:4057 - 4064.
[6] Ko J M, Chang O K, Kwon I H. Quality-of-service oriented web service composition algorithm and planning architecture [J]. Journal of Systems & Software, 2008, 81(11): 2079-2090.
[7] Zhang C W, Su S, Chen J L. Genetic Algorithm on Web Services Selection Supporting QoS [J]. Chinese Journal of Computers, 2006, 29(7): 1029-1037.
[8] Yu T, Lin K J. Service selection algorithms for Web services with end-to-end QoS constraints [J]. IEEE, 2005.
[9] Liu Z M, Zhou J L, Li C, et al. A Novel Genetic Mutation Operator for Maintaining Diversity [J]. Mini-micro Systems, 2003, 24(5): 902-904.

Downloads: 227
Visits: 29890

Sponsors, Associates, and Links


All published work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © 2016 - 2031 Clausius Scientific Press Inc. All Rights Reserved.