ANTSW
2006
Springer
13 years 6 months ago
2006
Springer
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in t...
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
Ant colony optimisation is a constructive metaheuristic that successively builds solutions from problem-specific components. A parameterised model known as pheromone--an analogue o...
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper we present an estimation of distribution particle swarm optimization algorithm that borrows ideas from recent developments in ant colony optimization. In th...
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. They appeared in our life some years ago with the awakening of the PC and now the are everywhere : computers have become ubiquitous and, almost, irreplaceable. Classical ...
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In previous papers we proposed an algorithm for real parameter optimization called the Aggregation Pheromone System (APS). The APS replaces pheromone trails in traditiona...
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...