A Novel Genetic Algorithm for QoS-Aware Web Services Selection

Zhang, Chengwen; Su, Sen; Chen, Junliang

doi:10.1007/11780397_18

Cited by 30 publications

(34 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To cope with this issue, other approaches propose heuristic-based solutions (e.g., WS-HEU and WFlow [5], Genetic algorithm [8,9,6,7,10,11,12]) aiming to find near-optimal compositions, i.e., compositions that respect global QoS constraints and maximize a QoS utility function. Yu et al [5] present two heuristics, WS-HEU and WFlow, for the service selection problem.…”

Section: Related Workmentioning

confidence: 99%

“…Other approaches [8,9,6,7,10,11,12] present heuristics based on a genetic algorithm. The application of such algorithm to the service selection problem presents two main drawbacks: first, the order in which service candidates are checked is randomly chosen (e.g., Crossing [6]), whereas in our approach we aim at checking services in an ordered way to optimize the timeliness and the optimality of our algorithm.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

QoS-Aware Service Composition in Dynamic Service Oriented Environments

et al. 2009

View full text Add to dashboard Cite

Abstract. QoS-aware service composition is a key requirement in Service Oriented Computing (SOC) since it enables fulfilling complex user tasks while meeting Quality of Service (QoS) constraints. A challenging issue towards this purpose is the selection of the best set of services to compose, meeting global QoS constraints imposed by the user, which is known to be a NP-hard problem. This challenge becomes even more relevant when it is considered in the context of dynamic service environments. Indeed, two specific issues arise. First, required tasks are fulfilled on the fly, thus the time available for services' selection and composition is limited. Second, service compositions have to be adaptive so that they can cope with changing conditions of the environment. In this paper, we present an efficient service selection algorithm that provides the appropriate ground for QoS-aware composition in dynamic service environments. Our algorithm is formed as a guided heuristic. The paper also presents a set of experiments conducted to evaluate the efficiency of our algorithm, which shows its timeliness and optimality.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

QoS-Aware Service Composition in Dynamic Service Oriented Environments

et al. 2009

View full text Add to dashboard Cite

show abstract

“…Exhaustive and evolutionary algorithms are two kinds of approaches of QoS-based optimization computation. Some algoritms must restart from the initial state when interrupted by unavailable services, which leads to lack of flexibility [10,11].…”

Section: Introductionmentioning

confidence: 99%

An Efficient QoS Preference Oriented Recommendation Scheme for the Internet of Services

Xin

Fan

Lai

2012

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract.Internet of services provides the services capabilities to interact and collaborate. Users are able to create, share and access services by means of heterogeneous devices and interaction channels, in extremely personalized ways. However, in the dynamic and ever-growing scenario, lacks of customization and flexibility have become more and more crucial. In this paper, a QoS preference oriented service recommendation scheme is proposed. First, the customer's preference is well described by a matrix model, which can be updated dynamically with customer's feedback evaluation. Entropy evaluation method is introduced to measure the weight coefficient of each QoS attribute. Furthermore, ant colony optimization algorithm is used to seek optimal service compositions. This recommending procedure will be repeated until the customer's requirement is satisfied, also can be restarted whenever the service process is blocked in execution. Theoretical analysis and numerical simulation indicate that the proposed scheme can satisfy the customer's requirements effectively and flexibly.

show abstract

“…Following the above analyses, we proposed a novel relation matrix coding scheme of chromosomes in [21], the relation matrix coding scheme suits with web service composition with global QoS constraints more than the one dimension coding scheme. In [20], we presented a population diversity handling mechanism.…”

Section: Introductionmentioning

confidence: 99%

“…In [21], a special relation matrix coding scheme of chromosomes is presented. It suits with QoS-aware web service composition more than the one dimension coding scheme.…”

Section: Quality Computation-based Selection Of Web Servicesmentioning

confidence: 99%

An Improved Genetic Algorithm for Web Services Selection

Zhang

Chen

2007

Distributed Applications and Interoperable Systems

Self Cite

View full text Add to dashboard Cite

Abstract. An improved genetic algorithm is presented to select optimal web services composite plans from a lot of composite plans on the basis of global Quality-of-Service (QoS) constraints. The relation matrix coding scheme of genome is its basis. In this genetic algorithm, an especial fitness function and a mutation policy are proposed on the basis of the relation matrix coding scheme of genome. They enhance convergence of genetic algorithm and can get more excellent composite service plan because they accord with web services selection very well. The simulation results on QoS-aware web services selection have shown that the improved genetic algorithm can gain effectively the composite service plan that satisfies the global QoS requirements, and that the convergence of genetic algorithm was improved very well.

show abstract

A Novel Genetic Algorithm for QoS-Aware Web Services Selection

Cited by 30 publications

References 13 publications

QoS-Aware Service Composition in Dynamic Service Oriented Environments

QoS-Aware Service Composition in Dynamic Service Oriented Environments

An Efficient QoS Preference Oriented Recommendation Scheme for the Internet of Services

An Improved Genetic Algorithm for Web Services Selection

Contact Info

Product

Resources

About