Abstract
Genetic algorithms are popular for service selection as they deliver good results in short time. However, current approaches do not consider compliance rules for single tasks in a process model. To address this issue, we present an approach for compliance-aware service selection with genetic algorithms. Our approach employs the notion of compliance distance to detect and recover violations and can be integrated into existing genetic algorithms by means of a repair operation. As a proof-of-concept, we present a genetic algorithm incorporating our approach and compare it with related state-of-the-art genetic algorithms lacking this kind of check and recovery mechanism for compliance. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Karatas, F., & Kesdogan, D. (2013). An approach for compliance-aware service selection with genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8274 LNCS, pp. 465–473). https://doi.org/10.1007/978-3-642-45005-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.