Sciweavers

206 search results - page 8 / 42
» Ant colony optimization and the minimum cut problem
Sort
View
74
Voted
CAS
2008
68views more  CAS 2008»
14 years 9 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli
ECAI
2000
Springer
15 years 1 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
LSSC
2007
Springer
15 years 3 months ago
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
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...
Stefka Fidanova
54
Voted
IPPS
2007
IEEE
15 years 4 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
TEC
2002
103views more  TEC 2002»
14 years 9 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