In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
It is known that one of the most disastrous forms of collective human behavior is the kind of crowd stampede induced by panic. This situation often leads to fatalities as people a...
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...