By Topic

On the Dynamic Ant Colony Algorithm Optimization Based on Multi-pheromones

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ya-mei Xia ; State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing ; Jun-Liang Chen ; Xiang-wu Meng

In this paper, an algorithm DACO (dynamic ant colony optimization algorithm based on multi- pheromones) is put forward to apply to the dynamics of web services state and QoS in service composition optimization. In order to denote users' needs more accurately, this algorithm sets multiple pheromones. The DACO is also improved based on experiment in order to make it better and faster converge to optimization value. Simulation experiment in this paper shows that the DACO is more effective than Ant Colony Algorithm and a Genetic Algorithm applied to services composition.

Published in:

Computer and Information Science, 2008. ICIS 08. Seventh IEEE/ACIS International Conference on

Date of Conference:

14-16 May 2008