Proceedings of the 3rd International Workshop on Services Integration in Pervasive Environments 2008
DOI: 10.1145/1387309.1387313
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithm-based optimization of service composition and deployment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(17 citation statements)
references
References 5 publications
0
17
0
Order By: Relevance
“…Genetic-based techniques for selecting the optimal Web service composition have been proposed in [2,5,10,11,14,[20][21][22] (see Table 1). In the approaches presented in Table 1, a genetic individual is mapped on a composition solution encoded using discrete representations (e.g.…”
Section: Non-hybrid Nature-inspired Techniquesmentioning
confidence: 99%
“…Genetic-based techniques for selecting the optimal Web service composition have been proposed in [2,5,10,11,14,[20][21][22] (see Table 1). In the approaches presented in Table 1, a genetic individual is mapped on a composition solution encoded using discrete representations (e.g.…”
Section: Non-hybrid Nature-inspired Techniquesmentioning
confidence: 99%
“…Genetic algorithm (GA) [13] is an efficient Search method based on principles of Population genetic.GA is a tool to solve complex combinatorial optimization problems. It is based on the mechanism of evolution and solving intractable optimization Problem.…”
Section: Web Service Selection Based On Genetic Algorithmmentioning
confidence: 99%
“…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%