Abstract
In the service-oriented environment, large-scale Service Composition (SC) has become an important research, where Quality of Service (QoS) has been applied widely. QoS is generally used to represent non-functional properties of web services and differentiate them with the same functionality. Studying how to select appropriate services for a composition from a very large number of similar candidate services is an NP-hard problem. However, there are limitations among existing methods, e.g. poor scalability and massive calculation in the exhaustion method, slow convergence speed and easy to fall into local optimum in the traditional evolutionary computation method. Thus, in this paper, an improved fruit fly optimisation algorithm called IFOA4WSC is proposed, which is quick and effective for web service composition. We analyse the convergence of fruit fly swarms in IFOA4WSC algorithm, and carry out a large number of simulation experiments in the common and random data sets. Experimental results show that IFOA4WSC is effective and highly efficient, and has better stability against classical PSO, GA and FOA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
