Sciweavers

1484 search results - page 20 / 297
» Ants meeting algorithms
Sort
View
SAGA
2005
Springer
14 years 1 months ago
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
Walter J. Gutjahr
IICS
2010
Springer
13 years 11 months ago
Self-Organizing Ant-based Information Gossiping Algorithm for P2P Networks
They appeared in our life only few years ago and now they are everywhere: computers have become ubiquitous and, almost, irreplaceable. Classical ways of creating, managing and exch...
Christophe Guéret, Nicolas Monmarché...
CN
2007
104views more  CN 2007»
13 years 7 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
IPPS
2000
IEEE
14 years 3 days ago
Information Exchange in Multi Colony Ant Algorithms
Multi colony ant algorithms are evolutionary optimization heuristics that are well suited for parallel execution. Information exchange between the colonies is an important topic th...
Martin Middendorf, Frank Reischle, Hartmut Schmeck
TEC
2002
103views more  TEC 2002»
13 years 7 months ago
A short convergence proof for a class of ant colony optimization algorithms
In this paper, we prove some convergence properties for a class of ant colony optimization algorithms. In particular, we prove that for any small constant 0 and for a sufficiently ...
Thomas Stützle, Marco Dorigo