Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Cuckoo-inspired hybrid algorithm for selecting the optimal Web service composition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Pop, C.B. ; Dept. of Comput. Sci., Tech. Univ. of Cluj Napoca, Cluj-Napoca, Romania ; Chifu, V.R. ; Salomie, I. ; Vlad, M.

This paper presents a bio-inspired hybrid algorithm that selects the optimal solution in semantic Web service composition. The proposed algorithm combines the cuckoo search metaheuristic with evolutionary computing, reinforcement learning and tabu search to optimize the selection process in terms of execution time and explored search space. We model the search space as an Enhanced Planning Graph structure which encodes all the possible composition solutions for a given user request. To establish whether a solution is optimal, the QoS attributes of the services involved in the composition as well as the semantic similarity between them are considered as evaluation criteria. The hybrid selection algorithm has been evaluated on a set of scenarios from the trip planning domain and comparatively analyzed with a tabu search-based selection algorithm.

Published in:

Intelligent Computer Communication and Processing (ICCP), 2011 IEEE International Conference on

Date of Conference:

25-27 Aug. 2011