Name
Abstract | ||
|---|---|---|
In this paper, a general Combinatorial Ant System-based fault tolerant distributed routing algorithm modeled like a dynamic combinatorial optimization problem is presented. In the proposed algorithm, the solution space of the dynamic combinatorial optimization problem is mapped into the space where the ants will walk, and the transition probability and the pheromone update formula of the Ant System is defined according to the objective function of the communication problem. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11538059_54 | ICIC (1) |
Keywords | Field | DocType |
combinatorial ant system,ant system,system-based fault tolerant,dynamic combinatorial optimization problem,communication problem,objective function,solution space,transition probability,proposed algorithm,pheromone update formula,general combinatorial ant | Dynamic programming,Mathematical optimization,Quadratic assignment problem,Computer science,Algorithm,Combinatorial optimization,Travelling salesman problem,Fault tolerance,Distributed algorithm,Optimization problem,Routing algorithm,Distributed computing | Conference |
Volume | ISSN | ISBN |
3644 | 0302-9743 | 3-540-28226-2 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jose Aguilar | 1 | 8 | 1.76 |
| Miguel Labrador | 2 | 9 | 1.28 |