An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Communications of the ACM
Empirical Analysis of the Factors that Affect the Baldwin Effect
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Toward autonomic web services trust and selection
Proceedings of the 2nd international conference on Service oriented computing
Service-Oriented Computing: Key Concepts and Principles
IEEE Internet Computing
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Preference-based selection of highly configurable web services
Proceedings of the 16th international conference on World Wide Web
Quick convergence of genetic algorithm for QoS-driven web service selection
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Method for Automated Web Service Selection
SERVICES '08 Proceedings of the 2008 IEEE Congress on Services - Part I
Enhancing Web Service Selection by User Preferences of Non-functional Features
NWESP '08 Proceedings of the 2008 4th International Conference on Next Generation Web Services Practices
A Fast Heuristic Algorithm for the Composite Web Service Selection
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
Dynamic selection mechanism for quality of service aware web services
Enterprise Information Systems
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A tutorial for competent memetic algorithms: model, taxonomy, and design issues
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Due to the changing nature of service-oriented environments, the ability to locate services of interest in such open, dynamic, and distributed environments has become an essential requirement. Current service-oriented architecture standards mainly rely on functional properties, however, service registries lack mechanisms for managing services' non-functional properties. Such non-functional properties are expressed in terms of quality of service (QoS) attributes. QoS for web services allows consumers to have confidence in the use of services by aiming to experience good service performance in terms of waiting time, reliability, and availability. This paper investigates the service selection process, and proposes two approaches; one that is based on a genetic algorithm, and the other is based on a memetic algorithm to match consumers with services based on QoS attributes as closely as possible. Both approaches are compared with an optimal assignment algorithm called the Munkres algorithm, as well as a Random approach. Measurements are performed to quantify the overall match score, the execution time, and the scalability of all approaches.