Parameter Selection in Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
A DAML-Based Repository for QoS-Aware Semantic Web Service Selection
ICWS '04 Proceedings of the IEEE International Conference on Web Services
DAML-QoS Ontology for Web Services
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Efficient Selection and Monitoring of QoS-Aware Web Services with the WS-QoS Framework
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Adaptive Service Composition in Flexible Processes
IEEE Transactions on Software Engineering
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A review of particle swarm optimization. Part I: background and development
Natural Computing: an international journal
An Adaptive Service Selection Approach to Service Composition
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
QoS-aware web services selection with intuitionistic fuzzy set under consumer's vague perception
Expert Systems with Applications: An International Journal
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
An efficient job-shop scheduling algorithm based on particle swarm optimization
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
Web service selection, as an important part of Web service composition, has direct influence on the quality of composite service. Therefore, it has attracted many researchers to focus on the research of quality of service (QoS) driven Web service selection in the past years, and many algorithms based on integer programming (IP), mixed integer linear programming (MILP), multi-dimension multi-choice 0-1 knapsack problem (MMKP), Markov decision programming (MDP), genetic algorithm (GA), and particle swarm optimization (PSO) and so on, have been presented to solve it, respectively. However, these results have not been satisfied at all yet. In this paper, a new cooperative evolution (Co-evolution) algorithm consists of stochastic particle swarm optimization (SPSO) and simulated annealing (SA) is presented to solve the Web service selection problem (WSSP). Furthermore, in view of the practical Web service composition requirements, an algorithm used to resolve the service selection with multi-objective and QoS global optimization is presented based on SPSO and the intelligent optimization theory of multi-objective PSO, which can produce a set of Pareto optimal composite services with constraint principles by means of optimizing various objective functions simultaneously. Experimental results show that Co-evolution algorithm owns better global convergence ability with faster convergence speed. Meanwhile, multi-objective SPSO is both feasible and efficient.