Abstract

Majority of the dynamic web service composition techniques in the literature addresses the problem of web service composition through the perspectives of quality of service (QoS) or transactional characteristics. Grenade with Cauchy operator integrated artificial bee colony optimisation (GCO-ABC) algorithm is proposed as an attempt of developing a dynamic service composition involved computation methodology that depends on the integration of transactional and QoS-based properties of web services. GCO-ABC algorithm is applied on the work flow sequence of web service composition developed as a constrained directed acyclic graph for determining the near optimal solution with efficacy and it is also predominant in comparison to the traditional ant colony optimisation algorithm (ACOM) and its variant improved ant colony optimisation algorithm (IACOM). The determined results investigated through empirical and simulation means infer that the proposed scheme is not only efficient but also capable of approximating the searching solutions into a much more optimal candidate solution.

Full Text
Published version (Free)

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 call