QoS‐aware big service composition using distributed co‐evolutionary algorithm

Big services are collections of interrelated web services across virtual and physical domains, processing Big Data. Existing service selection and composition algorithms fail to achieve the global optimum solution in a reasonable time. In this paper, we design an efficient quality of service‐aware big service composition methodology using a distributed co‐evolutionary algorithm. In our proposed model, we develop a distributed NSGA‐III for finding the optimal Pareto front and a distributed multi‐objective Jaya algorithm for enhancing the diversity of solutions. The distributed co‐evolutionary algorithm finds the near‐optimal solution in a fast and scalable way.