Please use this identifier to cite or link to this item:
|Title:||Towards Heuristic Web Services Composition Using Immune Algorithm|
|Publisher:||Institute of Electrical and Electronics Engineers (IEEE)|
|Citation:||Web Services, 2008. ICWS '08. IEEE International Conference on, Proceedings of, pp. 238-245.|
|Abstract:||One of the main benefits of web services is the dynamic composability, however how to achieve this is one of the current research challenges. Web service composition has been studied and, amongst other methods, the use of natural computing methods has been proposed previously. In this paper, we address the need for a fast response when computing the most suitable sequence of services. In particular, we propose a novel heuristic immune algorithm with an efficient encoding and mutation method. The algorithm involves two steps: an immune selection operation, which is maintaining antibody population diversity and a clonal selection. The use of a vaccine during the evolution provides heuristic information that accelerates the convergence. Our experimental results illustrate that the proposed heuristic immune algorithm is very effective in improving the convergence speed.|
|Rights:||This is the author's final draft of the paper published in : Web Services, 2008. ICWS '08. IEEE International Conference on, Proceedings of, pp. 238-245. The final version is available from http://ieeexplore.ieee.org/. Doi: 10.1109/ICWS.2008.16. Copyright © 2008 IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Leicester’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to email@example.com. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.|
|Appears in Collections:||Conference Papers & Presentations, Dept. of Computer Science|
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.