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

Author

Xia, Ya-mei ; Chen, Jun-liang ; Meng, Xiang-Wu

Author_Institution

State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing

fYear

2008

Firstpage

630

Lastpage

635

Abstract

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.

Keywords

optimisation; QoS; Web services state; ant colony algorithm; dynamic ant colony algorithm optimization; genetic algorithm; multi pheromones; Ant colony optimization; Computer networks; Genetic algorithms; Heuristic algorithms; Information science; Ontologies; Optimization methods; Semantic Web; Telecommunication computing; Web services; Ant Colony Algorithm; optimization; services composition;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Portland, OR

Print_ISBN

978-0-7695-3131-1

Type

conf

DOI

10.1109/ICIS.2008.112

Filename

4529887