Abstract

A lot of work have been carried out to find the efficient algorithms for QoS-aware dynamic web service composition. The multi-objective multi-choice problem as an evolutive multi-dimension multi-objective 0-1 knapsack problem (MMKP) can be reduced into the web service composition with multiple QoS constraints, while many approaches based on ant colony optimization (AOC) have been introduced in order for solving MMKP. This paper presents a novel QoS-aware dynamic web service composition optimization algorithm with improved AOC. The essence of the algorithm is that the problem of dynamic web service selection with QoS global optimality is transformed into a multi-objective multi-choice QoS-aware web services composition optimization (an evolutive MMKP), for the final purpose of our algorithm is to achieve Pareto Optimality.

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

Disclaimer: 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.