Abstract
An improved discrete immune optimization algorithm based on particle swarm optimization (IDIPSO) is proposed for Quality of Service (QoS)-driven web service composition with global QoS constraints. A series of effective strategies are presented for this problem, which include an improved local best first strategy based on mathematical analysis for candidate service selection, a perturbing global best strategy along the global best particle. The improved local best first strategy has equivalent effects on the local fitness of a candidate service and the fitness of a composite web service. Empirical comparisons with recently proposed algorithms on various scales of composite web service instances with global QoS constraints indicate that IDIPSO is highly competitive in terms of powerful searching capability, high stability and well trade-off between population diversity and selection pressure, especially when the size of the composite web service problem is large.
Original language | English |
---|---|
Pages (from-to) | 2208-2216 |
Number of pages | 9 |
Journal | Applied Soft Computing Journal |
Volume | 12 |
Issue number | 8 |
DOIs | |
State | Published - Aug 2012 |
Keywords
- Immune optimization
- Particle swarm optimization
- Quality of Service
- Web service